/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:20:24,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:20:24,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:20:24,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:20:24,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:20:24,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:20:24,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:20:24,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:20:24,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:20:24,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:20:24,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:20:24,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:20:24,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:20:24,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:20:24,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:20:24,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:20:24,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:20:24,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:20:24,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:20:24,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:20:24,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:20:24,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:20:24,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:20:24,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:20:24,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:20:24,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:20:24,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:20:24,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:20:24,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:20:24,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:20:24,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:20:24,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:20:24,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:20:24,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:20:24,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:20:24,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:20:24,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:20:24,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:20:24,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:20:24,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:20:24,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:20:24,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:20:24,500 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:20:24,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:20:24,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:20:24,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:20:24,503 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:20:24,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:20:24,504 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:20:24,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:20:24,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:20:24,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:20:24,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:20:24,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:20:24,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:20:24,505 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:20:24,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:20:24,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:20:24,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:20:24,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:20:24,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:20:24,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:20:24,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:20:24,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:20:24,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:20:24,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:20:24,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:20:24,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:20:24,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:20:24,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:20:24,507 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 00:20:24,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:20:24,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:20:24,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:20:24,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:20:24,846 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:20:24,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-12-06 00:20:26,023 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:20:26,223 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:20:26,224 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-12-06 00:20:26,229 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee90c5fc/f501ddf94b244f0093aad5d0597662ac/FLAG2b5a8e0b0 [2022-12-06 00:20:26,240 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee90c5fc/f501ddf94b244f0093aad5d0597662ac [2022-12-06 00:20:26,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:20:26,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:20:26,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:20:26,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:20:26,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:20:26,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6194ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26, skipping insertion in model container [2022-12-06 00:20:26,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:20:26,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:20:26,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:26,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:26,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:26,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:26,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:26,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:26,426 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-more-queue-add-2-nl.wvr.c[2870,2883] [2022-12-06 00:20:26,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:20:26,455 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:20:26,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:26,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:26,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:26,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:26,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:20:26,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:20:26,498 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-more-queue-add-2-nl.wvr.c[2870,2883] [2022-12-06 00:20:26,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:20:26,517 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:20:26,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26 WrapperNode [2022-12-06 00:20:26,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:20:26,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:20:26,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:20:26,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:20:26,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,572 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-12-06 00:20:26,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:20:26,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:20:26,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:20:26,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:20:26,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,600 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:20:26,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:20:26,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:20:26,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:20:26,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (1/1) ... [2022-12-06 00:20:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:20:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:26,633 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 00:20:26,658 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 00:20:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:20:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:20:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:20:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:20:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:20:26,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:20:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:20:26,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:20:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:20:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:20:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:20:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:20:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:20:26,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:20:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:20:26,676 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 00:20:26,833 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:20:26,834 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:20:27,120 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:20:27,269 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:20:27,269 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:20:27,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:20:27 BoogieIcfgContainer [2022-12-06 00:20:27,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:20:27,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:20:27,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:20:27,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:20:27,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:20:26" (1/3) ... [2022-12-06 00:20:27,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584dfa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:20:27, skipping insertion in model container [2022-12-06 00:20:27,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:20:26" (2/3) ... [2022-12-06 00:20:27,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584dfa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:20:27, skipping insertion in model container [2022-12-06 00:20:27,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:20:27" (3/3) ... [2022-12-06 00:20:27,278 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-12-06 00:20:27,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:20:27,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:20:27,294 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:20:27,380 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:20:27,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 133 transitions, 282 flow [2022-12-06 00:20:27,510 INFO L130 PetriNetUnfolder]: 11/131 cut-off events. [2022-12-06 00:20:27,511 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:27,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 131 events. 11/131 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 96. Up to 3 conditions per place. [2022-12-06 00:20:27,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 133 transitions, 282 flow [2022-12-06 00:20:27,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 123 transitions, 258 flow [2022-12-06 00:20:27,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:27,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 123 transitions, 258 flow [2022-12-06 00:20:27,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 123 transitions, 258 flow [2022-12-06 00:20:27,615 INFO L130 PetriNetUnfolder]: 11/123 cut-off events. [2022-12-06 00:20:27,615 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:27,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 123 events. 11/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 96. Up to 3 conditions per place. [2022-12-06 00:20:27,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 123 transitions, 258 flow [2022-12-06 00:20:27,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 00:20:33,496 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-06 00:20:33,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:20:33,514 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;@225cf3f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:20:33,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:20:33,518 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 00:20:33,518 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:20:33,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:33,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:33,519 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 00:20:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1007118935, now seen corresponding path program 1 times [2022-12-06 00:20:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:33,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80091713] [2022-12-06 00:20:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:33,944 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 00:20:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80091713] [2022-12-06 00:20:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80091713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:33,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:33,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108225315] [2022-12-06 00:20:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:33,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:33,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:33,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 00:20:33,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 00:20:33,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:33,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 00:20:33,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:34,166 INFO L130 PetriNetUnfolder]: 48/91 cut-off events. [2022-12-06 00:20:34,166 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 00:20:34,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 91 events. 48/91 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 196 event pairs, 24 based on Foata normal form. 8/74 useless extension candidates. Maximal degree in co-relation 131. Up to 81 conditions per place. [2022-12-06 00:20:34,168 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 15 selfloop transitions, 2 changer transitions 6/24 dead transitions. [2022-12-06 00:20:34,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 112 flow [2022-12-06 00:20:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 00:20:34,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-06 00:20:34,190 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 4 states and 31 transitions. [2022-12-06 00:20:34,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 112 flow [2022-12-06 00:20:34,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:34,203 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 58 flow [2022-12-06 00:20:34,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2022-12-06 00:20:34,208 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2022-12-06 00:20:34,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:34,209 INFO L89 Accepts]: Start accepts. Operand has 22 places, 18 transitions, 58 flow [2022-12-06 00:20:34,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:34,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:34,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 58 flow [2022-12-06 00:20:34,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 58 flow [2022-12-06 00:20:34,224 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-06 00:20:34,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:20:34,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 8/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 1 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 00:20:34,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 18 transitions, 58 flow [2022-12-06 00:20:34,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 00:20:35,368 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:35,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1161 [2022-12-06 00:20:35,370 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 54 flow [2022-12-06 00:20:35,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 00:20:35,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:35,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:35,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:20:35,379 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 00:20:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 406763210, now seen corresponding path program 1 times [2022-12-06 00:20:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:35,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963145089] [2022-12-06 00:20:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:36,154 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 00:20:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963145089] [2022-12-06 00:20:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963145089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:36,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:36,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649910471] [2022-12-06 00:20:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:36,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:36,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 00:20:36,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 54 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 00:20:36,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:36,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 00:20:36,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:36,360 INFO L130 PetriNetUnfolder]: 78/139 cut-off events. [2022-12-06 00:20:36,360 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 00:20:36,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 139 events. 78/139 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 381 event pairs, 1 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 352. Up to 89 conditions per place. [2022-12-06 00:20:36,364 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 31 selfloop transitions, 13 changer transitions 5/49 dead transitions. [2022-12-06 00:20:36,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 49 transitions, 243 flow [2022-12-06 00:20:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-12-06 00:20:36,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2022-12-06 00:20:36,369 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 54 flow. Second operand 8 states and 50 transitions. [2022-12-06 00:20:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 49 transitions, 243 flow [2022-12-06 00:20:36,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 49 transitions, 235 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:36,371 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 139 flow [2022-12-06 00:20:36,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=139, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 00:20:36,372 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 8 predicate places. [2022-12-06 00:20:36,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:36,372 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 139 flow [2022-12-06 00:20:36,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:36,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:36,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 139 flow [2022-12-06 00:20:36,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 28 transitions, 139 flow [2022-12-06 00:20:36,386 INFO L130 PetriNetUnfolder]: 19/46 cut-off events. [2022-12-06 00:20:36,387 INFO L131 PetriNetUnfolder]: For 9/17 co-relation queries the response was YES. [2022-12-06 00:20:36,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 46 events. 19/46 cut-off events. For 9/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 92 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 117. Up to 27 conditions per place. [2022-12-06 00:20:36,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 28 transitions, 139 flow [2022-12-06 00:20:36,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 00:20:36,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [423] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] and [576] L70-2-->thread2EXIT: Formula: (and (= (+ v_~s~0_In_5 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= (+ v_~y~0_In_6 v_~C~0_In_7) v_~y~0_Out_18) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| (select (select |v_#memory_int_In_22| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4)))) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_22) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_6| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~n~0_In_9) (< v_~q_front~0_In_4 v_~q_back~0_In_6)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_6| 0)) InVars {~q_back~0=v_~q_back~0_In_6, ~C~0=v_~C~0_In_7, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_22|, ~y~0=v_~y~0_In_6, ~n~0=v_~n~0_In_9, ~s~0=v_~s~0_In_5, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, ~C~0=v_~C~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_6|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_6|, #memory_int=|v_#memory_int_In_22|, ~y~0=v_~y~0_Out_18, ~n~0=v_~n~0_In_9, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:36,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [423] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] and [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:37,197 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:37,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 826 [2022-12-06 00:20:37,198 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 147 flow [2022-12-06 00:20:37,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 00:20:37,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:37,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:37,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:20:37,199 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 00:20:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash 608084424, now seen corresponding path program 1 times [2022-12-06 00:20:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:37,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025703687] [2022-12-06 00:20:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:37,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:37,740 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 00:20:37,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:37,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025703687] [2022-12-06 00:20:37,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025703687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:37,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:37,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678117212] [2022-12-06 00:20:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:37,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:37,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:37,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:37,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 00:20:37,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 00:20:37,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:37,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 00:20:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:37,894 INFO L130 PetriNetUnfolder]: 65/117 cut-off events. [2022-12-06 00:20:37,895 INFO L131 PetriNetUnfolder]: For 137/142 co-relation queries the response was YES. [2022-12-06 00:20:37,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 117 events. 65/117 cut-off events. For 137/142 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 4 based on Foata normal form. 6/99 useless extension candidates. Maximal degree in co-relation 428. Up to 90 conditions per place. [2022-12-06 00:20:37,896 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 22 selfloop transitions, 12 changer transitions 5/41 dead transitions. [2022-12-06 00:20:37,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 274 flow [2022-12-06 00:20:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-06 00:20:37,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3051948051948052 [2022-12-06 00:20:37,898 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 147 flow. Second operand 7 states and 47 transitions. [2022-12-06 00:20:37,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 274 flow [2022-12-06 00:20:37,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 236 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:37,901 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 159 flow [2022-12-06 00:20:37,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2022-12-06 00:20:37,902 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-06 00:20:37,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:37,902 INFO L89 Accepts]: Start accepts. Operand has 33 places, 29 transitions, 159 flow [2022-12-06 00:20:37,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:37,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:37,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 29 transitions, 159 flow [2022-12-06 00:20:37,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 159 flow [2022-12-06 00:20:37,910 INFO L130 PetriNetUnfolder]: 16/42 cut-off events. [2022-12-06 00:20:37,911 INFO L131 PetriNetUnfolder]: For 15/16 co-relation queries the response was YES. [2022-12-06 00:20:37,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 42 events. 16/42 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 112. Up to 17 conditions per place. [2022-12-06 00:20:37,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 29 transitions, 159 flow [2022-12-06 00:20:37,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 00:20:38,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] $Ultimate##0-->L70-2: Formula: (= v_~s~0_10 0) InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_19|, ~s~0=v_~s~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~s~0] and [581] $Ultimate##0-->thread2EXIT: Formula: (and (= (+ v_~s~0_77 |v_thread2Thread1of1ForFork1_~j~0#1_47|) v_~s~0_76) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_47| (select (select |v_#memory_int_158| v_~q~0.base_114) (+ v_~q~0.offset_114 (* 4 v_~q_front~0_115)))) (= v_~y~0_79 (+ v_~y~0_80 v_~C~0_82)) (= |v_thread2Thread1of1ForFork1_~j~0#1_47| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_21|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_21| 0) (= (ite (and (< v_~q_front~0_115 v_~q_back~0_176) (<= 0 v_~q_front~0_115) (< v_~q_front~0_115 v_~n~0_105)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (= (+ 1 v_~q_front~0_115) v_~q_front~0_114)) InVars {~q_back~0=v_~q_back~0_176, ~C~0=v_~C~0_82, #memory_int=|v_#memory_int_158|, ~q~0.base=v_~q~0.base_114, ~y~0=v_~y~0_80, ~n~0=v_~n~0_105, ~q~0.offset=v_~q~0.offset_114, ~s~0=v_~s~0_77, ~q_front~0=v_~q_front~0_115} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_47|, ~q_back~0=v_~q_back~0_176, ~C~0=v_~C~0_82, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_29|, ~q~0.base=v_~q~0.base_114, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_29|, ~q~0.offset=v_~q~0.offset_114, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_21|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_158|, ~y~0=v_~y~0_79, ~n~0=v_~n~0_105, ~s~0=v_~s~0_76, ~q_front~0=v_~q_front~0_114} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:38,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] $Ultimate##0-->L70-2: Formula: (= v_~s~0_10 0) InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_19|, ~s~0=v_~s~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~s~0] and [582] $Ultimate##0-->L70-2: Formula: (and (= (ite (and (< v_~q_front~0_119 v_~q_back~0_178) (<= 0 v_~q_front~0_119) (< v_~q_front~0_119 v_~n~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_31|) (= v_~s~0_80 (+ v_~s~0_81 |v_thread2Thread1of1ForFork1_~j~0#1_49|)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_51| 0) (= (+ v_~y~0_84 v_~C~0_84) v_~y~0_83) (= |v_thread2Thread1of1ForFork1_~j~0#1_49| (select (select |v_#memory_int_160| v_~q~0.base_116) (+ v_~q~0.offset_116 (* 4 v_~q_front~0_119)))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_49| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_31|) (= (+ 1 v_~q_front~0_119) v_~q_front~0_118)) InVars {~q_back~0=v_~q_back~0_178, ~C~0=v_~C~0_84, #memory_int=|v_#memory_int_160|, ~q~0.base=v_~q~0.base_116, ~y~0=v_~y~0_84, ~n~0=v_~n~0_107, ~q~0.offset=v_~q~0.offset_116, ~s~0=v_~s~0_81, ~q_front~0=v_~q_front~0_119} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_49|, ~q_back~0=v_~q_back~0_178, ~C~0=v_~C~0_84, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_31|, ~q~0.base=v_~q~0.base_116, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_31|, ~q~0.offset=v_~q~0.offset_116, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|, #memory_int=|v_#memory_int_160|, ~y~0=v_~y~0_83, ~n~0=v_~n~0_107, ~s~0=v_~s~0_80, ~q_front~0=v_~q_front~0_118} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:38,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] $Ultimate##0-->L70-2: Formula: (= v_~s~0_10 0) InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_19|, ~s~0=v_~s~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~s~0] and [583] $Ultimate##0-->L49-5: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_81)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|) (not (= (ite (and (< v_~q_back~0_181 v_~n~0_109) (<= 0 v_~q_back~0_181)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= v_~x~0_89 (+ v_~x~0_90 v_~C~0_86)) (= (ite (= (select (select |v_#memory_int_162| v_~q~0.base_118) (+ (* v_~q_back~0_181 4) v_~q~0.offset_118)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|) (= v_~q_back~0_180 (+ v_~q_back~0_181 1))) InVars {~q_back~0=v_~q_back~0_181, ~C~0=v_~C~0_86, #memory_int=|v_#memory_int_162|, ~N~0=v_~N~0_81, ~q~0.base=v_~q~0.base_118, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_118, ~x~0=v_~x~0_90} OutVars{~q_back~0=v_~q_back~0_180, ~C~0=v_~C~0_86, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_19|, ~N~0=v_~N~0_81, ~q~0.base=v_~q~0.base_118, ~q~0.offset=v_~q~0.offset_118, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_19|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39|, #memory_int=|v_#memory_int_162|, ~n~0=v_~n~0_109, ~x~0=v_~x~0_89} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0] [2022-12-06 00:20:38,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] $Ultimate##0-->L70-2: Formula: (= v_~s~0_10 0) InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_19|, ~s~0=v_~s~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~s~0] and [584] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_~i~0#1_57| 0) (not (= 0 (ite (and (<= 0 v_~q_back~0_185) (< v_~q_back~0_185 v_~n~0_111)) 1 0))) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= (ite (= (select (select |v_#memory_int_164| v_~q~0.base_120) (+ (* v_~q_back~0_185 4) v_~q~0.offset_120)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x~0_93 (+ v_~x~0_94 v_~C~0_88)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_57| v_~N~0_83)) (= v_~q_back~0_184 (+ v_~q_back~0_185 1))) InVars {~q_back~0=v_~q_back~0_185, ~C~0=v_~C~0_88, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_83, ~q~0.base=v_~q~0.base_120, ~n~0=v_~n~0_111, ~q~0.offset=v_~q~0.offset_120, ~x~0=v_~x~0_94} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, ~q_back~0=v_~q_back~0_184, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_23|, ~C~0=v_~C~0_88, ~N~0=v_~N~0_83, ~q~0.base=v_~q~0.base_120, ~q~0.offset=v_~q~0.offset_120, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_57|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, #memory_int=|v_#memory_int_164|, ~n~0=v_~n~0_111, ~x~0=v_~x~0_93, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 00:20:38,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->thread1EXIT: Formula: (and (= (ite (= (select (select |v_#memory_int_176| v_~q~0.base_132) (+ (* v_~q_back~0_201 4) v_~q~0.offset_132)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= v_~s~0_102 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_65| v_~N~0_87)) (= v_~q_back~0_200 (+ v_~q_back~0_201 1)) (= (+ v_~x~0_102 v_~C~0_100) v_~x~0_101) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (= (ite (and (< v_~q_back~0_201 v_~n~0_123) (<= 0 v_~q_back~0_201)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_201, ~C~0=v_~C~0_100, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87, ~q~0.base=v_~q~0.base_132, ~n~0=v_~n~0_123, ~q~0.offset=v_~q~0.offset_132, ~x~0=v_~x~0_102} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_69|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~q_back~0=v_~q_back~0_200, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_25|, ~C~0=v_~C~0_100, ~N~0=v_~N~0_87, ~q~0.base=v_~q~0.base_132, ~q~0.offset=v_~q~0.offset_132, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, #memory_int=|v_#memory_int_176|, ~n~0=v_~n~0_123, ~x~0=v_~x~0_101, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|, ~s~0=v_~s~0_102} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork0_#res#1.base, ~s~0] and [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:38,886 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:38,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 985 [2022-12-06 00:20:38,887 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 173 flow [2022-12-06 00:20:38,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 00:20:38,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:38,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:38,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:20:38,888 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 00:20:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -519632001, now seen corresponding path program 1 times [2022-12-06 00:20:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:38,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835190023] [2022-12-06 00:20:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:39,107 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 00:20:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:39,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835190023] [2022-12-06 00:20:39,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835190023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:39,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:39,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649964212] [2022-12-06 00:20:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:39,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:39,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 00:20:39,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 173 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 00:20:39,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:39,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 00:20:39,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:39,421 INFO L130 PetriNetUnfolder]: 72/143 cut-off events. [2022-12-06 00:20:39,421 INFO L131 PetriNetUnfolder]: For 131/136 co-relation queries the response was YES. [2022-12-06 00:20:39,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 143 events. 72/143 cut-off events. For 131/136 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 439 event pairs, 7 based on Foata normal form. 13/124 useless extension candidates. Maximal degree in co-relation 492. Up to 69 conditions per place. [2022-12-06 00:20:39,423 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 30 selfloop transitions, 9 changer transitions 4/43 dead transitions. [2022-12-06 00:20:39,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 277 flow [2022-12-06 00:20:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 00:20:39,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2022-12-06 00:20:39,424 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 173 flow. Second operand 4 states and 53 transitions. [2022-12-06 00:20:39,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 277 flow [2022-12-06 00:20:39,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 251 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:39,426 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 152 flow [2022-12-06 00:20:39,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 00:20:39,427 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-06 00:20:39,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:39,427 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 152 flow [2022-12-06 00:20:39,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:39,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:39,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 152 flow [2022-12-06 00:20:39,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 152 flow [2022-12-06 00:20:39,436 INFO L130 PetriNetUnfolder]: 13/48 cut-off events. [2022-12-06 00:20:39,436 INFO L131 PetriNetUnfolder]: For 24/26 co-relation queries the response was YES. [2022-12-06 00:20:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 48 events. 13/48 cut-off events. For 24/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 150. Up to 25 conditions per place. [2022-12-06 00:20:39,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 152 flow [2022-12-06 00:20:39,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 00:20:39,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:39,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 00:20:39,446 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 152 flow [2022-12-06 00:20:39,446 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 00:20:39,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:39,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:39,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:20:39,447 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 00:20:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -520226647, now seen corresponding path program 1 times [2022-12-06 00:20:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:39,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718449555] [2022-12-06 00:20:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:40,047 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 00:20:40,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:40,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718449555] [2022-12-06 00:20:40,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718449555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:40,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:40,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908862158] [2022-12-06 00:20:40,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:40,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:40,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:40,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:40,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 00:20:40,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 00:20:40,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:40,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 00:20:40,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:40,662 INFO L130 PetriNetUnfolder]: 72/150 cut-off events. [2022-12-06 00:20:40,662 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-06 00:20:40,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 150 events. 72/150 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 426 event pairs, 27 based on Foata normal form. 10/126 useless extension candidates. Maximal degree in co-relation 599. Up to 127 conditions per place. [2022-12-06 00:20:40,666 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 23 selfloop transitions, 2 changer transitions 13/38 dead transitions. [2022-12-06 00:20:40,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 297 flow [2022-12-06 00:20:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 00:20:40,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-06 00:20:40,668 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 152 flow. Second operand 5 states and 34 transitions. [2022-12-06 00:20:40,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 297 flow [2022-12-06 00:20:40,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 242 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:40,674 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 136 flow [2022-12-06 00:20:40,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-06 00:20:40,676 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-06 00:20:40,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:40,677 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 136 flow [2022-12-06 00:20:40,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:40,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:40,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 136 flow [2022-12-06 00:20:40,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 136 flow [2022-12-06 00:20:40,685 INFO L130 PetriNetUnfolder]: 13/49 cut-off events. [2022-12-06 00:20:40,685 INFO L131 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2022-12-06 00:20:40,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 49 events. 13/49 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 123. Up to 15 conditions per place. [2022-12-06 00:20:40,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 136 flow [2022-12-06 00:20:40,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 00:20:42,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:42,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1330 [2022-12-06 00:20:42,008 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 132 flow [2022-12-06 00:20:42,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 00:20:42,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:42,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:20:42,008 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 00:20:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash -39498442, now seen corresponding path program 1 times [2022-12-06 00:20:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:42,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668127720] [2022-12-06 00:20:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:42,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:42,823 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 00:20:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:42,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668127720] [2022-12-06 00:20:42,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668127720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:42,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:42,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853181055] [2022-12-06 00:20:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:42,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:42,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:42,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 00:20:42,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) 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 00:20:42,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:42,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 00:20:42,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:43,080 INFO L130 PetriNetUnfolder]: 106/196 cut-off events. [2022-12-06 00:20:43,081 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-06 00:20:43,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 196 events. 106/196 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 585 event pairs, 15 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 722. Up to 140 conditions per place. [2022-12-06 00:20:43,083 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 37 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2022-12-06 00:20:43,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 342 flow [2022-12-06 00:20:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:20:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:20:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 00:20:43,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-06 00:20:43,086 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 132 flow. Second operand 6 states and 44 transitions. [2022-12-06 00:20:43,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 342 flow [2022-12-06 00:20:43,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 49 transitions, 310 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:43,088 INFO L231 Difference]: Finished difference. Result has 33 places, 35 transitions, 232 flow [2022-12-06 00:20:43,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=33, PETRI_TRANSITIONS=35} [2022-12-06 00:20:43,091 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-06 00:20:43,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:43,091 INFO L89 Accepts]: Start accepts. Operand has 33 places, 35 transitions, 232 flow [2022-12-06 00:20:43,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:43,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:43,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 35 transitions, 232 flow [2022-12-06 00:20:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 35 transitions, 232 flow [2022-12-06 00:20:43,104 INFO L130 PetriNetUnfolder]: 33/92 cut-off events. [2022-12-06 00:20:43,105 INFO L131 PetriNetUnfolder]: For 58/60 co-relation queries the response was YES. [2022-12-06 00:20:43,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 92 events. 33/92 cut-off events. For 58/60 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 269 event pairs, 0 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 207. Up to 31 conditions per place. [2022-12-06 00:20:43,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 35 transitions, 232 flow [2022-12-06 00:20:43,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 00:20:46,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:46,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3302 [2022-12-06 00:20:46,393 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 240 flow [2022-12-06 00:20:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) 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 00:20:46,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:46,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:46,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:20:46,394 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 00:20:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash -4309963, now seen corresponding path program 1 times [2022-12-06 00:20:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:46,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230439497] [2022-12-06 00:20:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:46,769 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 00:20:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230439497] [2022-12-06 00:20:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230439497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:46,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:46,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616816370] [2022-12-06 00:20:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:46,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:46,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:20:46,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 00:20:46,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:46,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:20:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:46,921 INFO L130 PetriNetUnfolder]: 105/197 cut-off events. [2022-12-06 00:20:46,921 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-12-06 00:20:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 197 events. 105/197 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 602 event pairs, 24 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 702. Up to 139 conditions per place. [2022-12-06 00:20:46,923 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 37 selfloop transitions, 7 changer transitions 3/47 dead transitions. [2022-12-06 00:20:46,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 376 flow [2022-12-06 00:20:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 00:20:46,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39 [2022-12-06 00:20:46,925 INFO L175 Difference]: Start difference. First operand has 33 places, 35 transitions, 240 flow. Second operand 5 states and 39 transitions. [2022-12-06 00:20:46,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 376 flow [2022-12-06 00:20:46,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 357 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:46,929 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 224 flow [2022-12-06 00:20:46,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-06 00:20:46,930 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 00:20:46,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:46,930 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 224 flow [2022-12-06 00:20:46,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:46,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:46,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 224 flow [2022-12-06 00:20:46,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 224 flow [2022-12-06 00:20:46,942 INFO L130 PetriNetUnfolder]: 34/90 cut-off events. [2022-12-06 00:20:46,943 INFO L131 PetriNetUnfolder]: For 83/87 co-relation queries the response was YES. [2022-12-06 00:20:46,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 90 events. 34/90 cut-off events. For 83/87 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 263 event pairs, 0 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 245. Up to 29 conditions per place. [2022-12-06 00:20:46,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 224 flow [2022-12-06 00:20:46,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 00:20:46,945 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:46,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:20:46,946 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 224 flow [2022-12-06 00:20:46,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 00:20:46,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:46,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:46,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:20:46,947 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 00:20:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1831284232, now seen corresponding path program 1 times [2022-12-06 00:20:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:46,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870379770] [2022-12-06 00:20:46,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:47,511 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 00:20:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870379770] [2022-12-06 00:20:47,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870379770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:47,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:47,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082015719] [2022-12-06 00:20:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:47,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:47,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:20:47,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) 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 00:20:47,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:47,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:20:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:47,782 INFO L130 PetriNetUnfolder]: 173/322 cut-off events. [2022-12-06 00:20:47,782 INFO L131 PetriNetUnfolder]: For 500/500 co-relation queries the response was YES. [2022-12-06 00:20:47,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 322 events. 173/322 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1264 event pairs, 21 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 1117. Up to 177 conditions per place. [2022-12-06 00:20:47,785 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 51 selfloop transitions, 23 changer transitions 0/74 dead transitions. [2022-12-06 00:20:47,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 74 transitions, 577 flow [2022-12-06 00:20:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-12-06 00:20:47,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4276315789473684 [2022-12-06 00:20:47,789 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 224 flow. Second operand 8 states and 65 transitions. [2022-12-06 00:20:47,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 74 transitions, 577 flow [2022-12-06 00:20:47,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 543 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:47,793 INFO L231 Difference]: Finished difference. Result has 43 places, 49 transitions, 420 flow [2022-12-06 00:20:47,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=43, PETRI_TRANSITIONS=49} [2022-12-06 00:20:47,795 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 00:20:47,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:47,795 INFO L89 Accepts]: Start accepts. Operand has 43 places, 49 transitions, 420 flow [2022-12-06 00:20:47,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:47,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:47,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 49 transitions, 420 flow [2022-12-06 00:20:47,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 49 transitions, 420 flow [2022-12-06 00:20:47,816 INFO L130 PetriNetUnfolder]: 42/133 cut-off events. [2022-12-06 00:20:47,817 INFO L131 PetriNetUnfolder]: For 276/278 co-relation queries the response was YES. [2022-12-06 00:20:47,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 133 events. 42/133 cut-off events. For 276/278 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 566 event pairs, 1 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 425. Up to 36 conditions per place. [2022-12-06 00:20:47,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 49 transitions, 420 flow [2022-12-06 00:20:47,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 00:20:48,071 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:48,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-06 00:20:48,072 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 47 transitions, 420 flow [2022-12-06 00:20:48,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) 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 00:20:48,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:48,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:48,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:20:48,073 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 00:20:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:48,073 INFO L85 PathProgramCache]: Analyzing trace with hash -332901449, now seen corresponding path program 1 times [2022-12-06 00:20:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:48,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038747365] [2022-12-06 00:20:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:48,669 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 00:20:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:48,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038747365] [2022-12-06 00:20:48,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038747365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:48,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:48,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929359106] [2022-12-06 00:20:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:48,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:20:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:48,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:20:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:20:48,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:20:48,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 47 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:48,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:48,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:20:48,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:48,848 INFO L130 PetriNetUnfolder]: 200/375 cut-off events. [2022-12-06 00:20:48,848 INFO L131 PetriNetUnfolder]: For 1318/1318 co-relation queries the response was YES. [2022-12-06 00:20:48,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 375 events. 200/375 cut-off events. For 1318/1318 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1512 event pairs, 19 based on Foata normal form. 6/322 useless extension candidates. Maximal degree in co-relation 1609. Up to 235 conditions per place. [2022-12-06 00:20:48,851 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 52 selfloop transitions, 26 changer transitions 0/78 dead transitions. [2022-12-06 00:20:48,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 759 flow [2022-12-06 00:20:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:20:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:20:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 00:20:48,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-06 00:20:48,853 INFO L175 Difference]: Start difference. First operand has 41 places, 47 transitions, 420 flow. Second operand 6 states and 51 transitions. [2022-12-06 00:20:48,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 759 flow [2022-12-06 00:20:48,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 713 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:48,861 INFO L231 Difference]: Finished difference. Result has 48 places, 59 transitions, 582 flow [2022-12-06 00:20:48,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=48, PETRI_TRANSITIONS=59} [2022-12-06 00:20:48,862 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2022-12-06 00:20:48,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:48,862 INFO L89 Accepts]: Start accepts. Operand has 48 places, 59 transitions, 582 flow [2022-12-06 00:20:48,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:48,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:48,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 59 transitions, 582 flow [2022-12-06 00:20:48,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 59 transitions, 582 flow [2022-12-06 00:20:48,885 INFO L130 PetriNetUnfolder]: 58/174 cut-off events. [2022-12-06 00:20:48,885 INFO L131 PetriNetUnfolder]: For 357/366 co-relation queries the response was YES. [2022-12-06 00:20:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 174 events. 58/174 cut-off events. For 357/366 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 784 event pairs, 0 based on Foata normal form. 3/151 useless extension candidates. Maximal degree in co-relation 520. Up to 53 conditions per place. [2022-12-06 00:20:48,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 59 transitions, 582 flow [2022-12-06 00:20:48,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 00:20:51,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:51,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2897 [2022-12-06 00:20:51,759 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 59 transitions, 590 flow [2022-12-06 00:20:51,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:51,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:51,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:51,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:20:51,759 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 00:20:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 770186351, now seen corresponding path program 1 times [2022-12-06 00:20:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:51,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574446792] [2022-12-06 00:20:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:52,234 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 00:20:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:52,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574446792] [2022-12-06 00:20:52,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574446792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:52,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:52,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219589215] [2022-12-06 00:20:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:52,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:52,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:52,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:20:52,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 59 transitions, 590 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 00:20:52,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:52,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:20:52,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:52,432 INFO L130 PetriNetUnfolder]: 192/351 cut-off events. [2022-12-06 00:20:52,432 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2022-12-06 00:20:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 351 events. 192/351 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1353 event pairs, 23 based on Foata normal form. 2/307 useless extension candidates. Maximal degree in co-relation 1247. Up to 282 conditions per place. [2022-12-06 00:20:52,436 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 50 selfloop transitions, 20 changer transitions 3/73 dead transitions. [2022-12-06 00:20:52,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 825 flow [2022-12-06 00:20:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 00:20:52,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.344 [2022-12-06 00:20:52,437 INFO L175 Difference]: Start difference. First operand has 48 places, 59 transitions, 590 flow. Second operand 5 states and 43 transitions. [2022-12-06 00:20:52,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 825 flow [2022-12-06 00:20:52,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 779 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:52,443 INFO L231 Difference]: Finished difference. Result has 52 places, 62 transitions, 647 flow [2022-12-06 00:20:52,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=647, PETRI_PLACES=52, PETRI_TRANSITIONS=62} [2022-12-06 00:20:52,443 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-06 00:20:52,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:52,443 INFO L89 Accepts]: Start accepts. Operand has 52 places, 62 transitions, 647 flow [2022-12-06 00:20:52,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:52,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:52,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 62 transitions, 647 flow [2022-12-06 00:20:52,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 62 transitions, 647 flow [2022-12-06 00:20:52,463 INFO L130 PetriNetUnfolder]: 56/160 cut-off events. [2022-12-06 00:20:52,463 INFO L131 PetriNetUnfolder]: For 497/504 co-relation queries the response was YES. [2022-12-06 00:20:52,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 160 events. 56/160 cut-off events. For 497/504 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 704 event pairs, 0 based on Foata normal form. 3/155 useless extension candidates. Maximal degree in co-relation 618. Up to 48 conditions per place. [2022-12-06 00:20:52,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 62 transitions, 647 flow [2022-12-06 00:20:52,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:20:52,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:52,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:20:52,467 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 62 transitions, 647 flow [2022-12-06 00:20:52,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 00:20:52,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:52,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:52,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:20:52,467 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 00:20:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2116008403, now seen corresponding path program 1 times [2022-12-06 00:20:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631895848] [2022-12-06 00:20:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:53,414 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 00:20:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631895848] [2022-12-06 00:20:53,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631895848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:53,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:53,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205751073] [2022-12-06 00:20:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:53,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:53,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:20:53,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 62 transitions, 647 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:53,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:53,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:20:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:53,733 INFO L130 PetriNetUnfolder]: 197/362 cut-off events. [2022-12-06 00:20:53,733 INFO L131 PetriNetUnfolder]: For 1722/1722 co-relation queries the response was YES. [2022-12-06 00:20:53,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 362 events. 197/362 cut-off events. For 1722/1722 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1400 event pairs, 41 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1844. Up to 319 conditions per place. [2022-12-06 00:20:53,736 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 66 selfloop transitions, 11 changer transitions 5/82 dead transitions. [2022-12-06 00:20:53,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 899 flow [2022-12-06 00:20:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-06 00:20:53,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2022-12-06 00:20:53,738 INFO L175 Difference]: Start difference. First operand has 50 places, 62 transitions, 647 flow. Second operand 7 states and 53 transitions. [2022-12-06 00:20:53,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 899 flow [2022-12-06 00:20:53,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 871 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:53,745 INFO L231 Difference]: Finished difference. Result has 55 places, 63 transitions, 663 flow [2022-12-06 00:20:53,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=663, PETRI_PLACES=55, PETRI_TRANSITIONS=63} [2022-12-06 00:20:53,746 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 00:20:53,746 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:53,746 INFO L89 Accepts]: Start accepts. Operand has 55 places, 63 transitions, 663 flow [2022-12-06 00:20:53,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:53,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:53,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 63 transitions, 663 flow [2022-12-06 00:20:53,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 63 transitions, 663 flow [2022-12-06 00:20:53,766 INFO L130 PetriNetUnfolder]: 54/161 cut-off events. [2022-12-06 00:20:53,767 INFO L131 PetriNetUnfolder]: For 536/543 co-relation queries the response was YES. [2022-12-06 00:20:53,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 161 events. 54/161 cut-off events. For 536/543 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 724 event pairs, 0 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 683. Up to 46 conditions per place. [2022-12-06 00:20:53,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 63 transitions, 663 flow [2022-12-06 00:20:53,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 00:20:53,777 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:53,777 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:53,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L49-5-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_In_4) (< v_~q_back~0_In_4 v_~n~0_In_7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_6| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_6| 0) (= (+ v_~C~0_In_5 v_~x~0_In_6) v_~x~0_Out_18) (= (ite (= (select (select |v_#memory_int_In_20| v_~q~0.base_In_4) (+ (* v_~q_back~0_In_4 4) v_~q~0.offset_In_4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_18 (+ v_~q_back~0_In_4 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_7))) InVars {~q_back~0=v_~q_back~0_In_4, ~C~0=v_~C~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_20|, ~N~0=v_~N~0_In_7, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_7, ~x~0=v_~x~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_6|, ~q_back~0=v_~q_back~0_Out_18, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~C~0=v_~C~0_In_5, ~N~0=v_~N~0_In_7, ~q~0.base=v_~q~0.base_In_4, ~q~0.offset=v_~q~0.offset_In_4, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_Out_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_20|, ~n~0=v_~n~0_In_7, ~x~0=v_~x~0_Out_18, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork0_#res#1.base] and [569] L99-3-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_49| |v_#pthreadsForks_36|) (= (store |v_#memory_int_143| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre15#1_49|)) |v_#memory_int_142|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #memory_int=|v_#memory_int_142|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 00:20:54,029 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:54,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 00:20:54,030 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 668 flow [2022-12-06 00:20:54,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:54,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:54,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:54,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:20:54,030 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 00:20:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1035754826, now seen corresponding path program 1 times [2022-12-06 00:20:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:54,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613502490] [2022-12-06 00:20:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:54,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 00:20:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613502490] [2022-12-06 00:20:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613502490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:54,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:54,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385381814] [2022-12-06 00:20:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:54,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:20:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:20:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:20:54,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:20:54,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 668 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:54,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:54,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:20:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:54,645 INFO L130 PetriNetUnfolder]: 216/389 cut-off events. [2022-12-06 00:20:54,645 INFO L131 PetriNetUnfolder]: For 1914/1914 co-relation queries the response was YES. [2022-12-06 00:20:54,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 389 events. 216/389 cut-off events. For 1914/1914 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1531 event pairs, 30 based on Foata normal form. 10/382 useless extension candidates. Maximal degree in co-relation 2091. Up to 193 conditions per place. [2022-12-06 00:20:54,649 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 49 selfloop transitions, 25 changer transitions 0/74 dead transitions. [2022-12-06 00:20:54,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 886 flow [2022-12-06 00:20:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 00:20:54,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-06 00:20:54,650 INFO L175 Difference]: Start difference. First operand has 53 places, 62 transitions, 668 flow. Second operand 4 states and 41 transitions. [2022-12-06 00:20:54,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 886 flow [2022-12-06 00:20:54,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 839 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-06 00:20:54,658 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 698 flow [2022-12-06 00:20:54,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=698, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2022-12-06 00:20:54,658 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-06 00:20:54,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:54,659 INFO L89 Accepts]: Start accepts. Operand has 50 places, 61 transitions, 698 flow [2022-12-06 00:20:54,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:54,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:54,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 61 transitions, 698 flow [2022-12-06 00:20:54,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 61 transitions, 698 flow [2022-12-06 00:20:54,683 INFO L130 PetriNetUnfolder]: 56/172 cut-off events. [2022-12-06 00:20:54,683 INFO L131 PetriNetUnfolder]: For 622/629 co-relation queries the response was YES. [2022-12-06 00:20:54,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 172 events. 56/172 cut-off events. For 622/629 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 821 event pairs, 2 based on Foata normal form. 3/167 useless extension candidates. Maximal degree in co-relation 531. Up to 51 conditions per place. [2022-12-06 00:20:54,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 61 transitions, 698 flow [2022-12-06 00:20:54,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 00:20:54,685 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:54,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 00:20:54,688 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 61 transitions, 698 flow [2022-12-06 00:20:54,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:54,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:54,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:54,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:20:54,689 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 00:20:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1318420975, now seen corresponding path program 1 times [2022-12-06 00:20:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:54,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180742254] [2022-12-06 00:20:54,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:55,284 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 00:20:55,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:55,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180742254] [2022-12-06 00:20:55,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180742254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:55,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:55,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352924696] [2022-12-06 00:20:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:55,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:55,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:20:55,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 61 transitions, 698 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:55,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:55,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:20:55,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:55,517 INFO L130 PetriNetUnfolder]: 234/435 cut-off events. [2022-12-06 00:20:55,517 INFO L131 PetriNetUnfolder]: For 2183/2183 co-relation queries the response was YES. [2022-12-06 00:20:55,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 435 events. 234/435 cut-off events. For 2183/2183 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1871 event pairs, 23 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1466. Up to 316 conditions per place. [2022-12-06 00:20:55,521 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 53 selfloop transitions, 29 changer transitions 5/87 dead transitions. [2022-12-06 00:20:55,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 1034 flow [2022-12-06 00:20:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 00:20:55,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 00:20:55,522 INFO L175 Difference]: Start difference. First operand has 50 places, 61 transitions, 698 flow. Second operand 7 states and 55 transitions. [2022-12-06 00:20:55,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 1034 flow [2022-12-06 00:20:55,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 999 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:55,530 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 846 flow [2022-12-06 00:20:55,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=846, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-06 00:20:55,530 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 00:20:55,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:55,530 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 846 flow [2022-12-06 00:20:55,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:55,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:55,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 846 flow [2022-12-06 00:20:55,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 67 transitions, 846 flow [2022-12-06 00:20:55,553 INFO L130 PetriNetUnfolder]: 55/182 cut-off events. [2022-12-06 00:20:55,553 INFO L131 PetriNetUnfolder]: For 829/840 co-relation queries the response was YES. [2022-12-06 00:20:55,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 182 events. 55/182 cut-off events. For 829/840 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 919 event pairs, 2 based on Foata normal form. 4/179 useless extension candidates. Maximal degree in co-relation 847. Up to 51 conditions per place. [2022-12-06 00:20:55,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 67 transitions, 846 flow [2022-12-06 00:20:55,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 00:20:55,562 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:55,562 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:55,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:55,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 00:20:55,676 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 66 transitions, 836 flow [2022-12-06 00:20:55,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:55,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:55,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:55,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:20:55,676 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 00:20:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2080381463, now seen corresponding path program 1 times [2022-12-06 00:20:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:55,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710097961] [2022-12-06 00:20:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:55,814 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 00:20:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:55,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710097961] [2022-12-06 00:20:55,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710097961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:55,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:55,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70721394] [2022-12-06 00:20:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:55,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:55,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:20:55,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 66 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 00:20:55,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:55,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:20:55,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:55,989 INFO L130 PetriNetUnfolder]: 281/533 cut-off events. [2022-12-06 00:20:55,989 INFO L131 PetriNetUnfolder]: For 3766/3766 co-relation queries the response was YES. [2022-12-06 00:20:55,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 533 events. 281/533 cut-off events. For 3766/3766 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2414 event pairs, 97 based on Foata normal form. 8/521 useless extension candidates. Maximal degree in co-relation 3048. Up to 274 conditions per place. [2022-12-06 00:20:55,994 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 83 selfloop transitions, 1 changer transitions 6/90 dead transitions. [2022-12-06 00:20:55,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 1207 flow [2022-12-06 00:20:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 00:20:55,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 00:20:55,996 INFO L175 Difference]: Start difference. First operand has 56 places, 66 transitions, 836 flow. Second operand 4 states and 45 transitions. [2022-12-06 00:20:55,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 1207 flow [2022-12-06 00:20:56,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 1148 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:56,009 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 739 flow [2022-12-06 00:20:56,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=739, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2022-12-06 00:20:56,010 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 00:20:56,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:56,010 INFO L89 Accepts]: Start accepts. Operand has 56 places, 63 transitions, 739 flow [2022-12-06 00:20:56,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:56,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:56,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 63 transitions, 739 flow [2022-12-06 00:20:56,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 63 transitions, 739 flow [2022-12-06 00:20:56,036 INFO L130 PetriNetUnfolder]: 61/217 cut-off events. [2022-12-06 00:20:56,036 INFO L131 PetriNetUnfolder]: For 863/874 co-relation queries the response was YES. [2022-12-06 00:20:56,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 217 events. 61/217 cut-off events. For 863/874 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1188 event pairs, 2 based on Foata normal form. 4/210 useless extension candidates. Maximal degree in co-relation 859. Up to 59 conditions per place. [2022-12-06 00:20:56,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 63 transitions, 739 flow [2022-12-06 00:20:56,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 00:20:56,039 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:56,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 00:20:56,040 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 739 flow [2022-12-06 00:20:56,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 00:20:56,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:56,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:56,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:20:56,041 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 00:20:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash 685929897, now seen corresponding path program 1 times [2022-12-06 00:20:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:56,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411647683] [2022-12-06 00:20:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:56,706 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 00:20:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:56,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411647683] [2022-12-06 00:20:56,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411647683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:56,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058123497] [2022-12-06 00:20:56,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:56,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:56,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:56,710 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 00:20:56,731 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 00:20:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:56,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 00:20:56,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:57,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 00:20:57,213 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 00:20:57,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:57,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:20:57,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-12-06 00:20:57,468 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 00:20:57,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058123497] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:57,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:57,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 00:20:57,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979322197] [2022-12-06 00:20:57,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:57,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:20:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:57,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:20:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:20:57,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:20:57,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 739 flow. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:57,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:57,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:20:57,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:57,956 INFO L130 PetriNetUnfolder]: 309/593 cut-off events. [2022-12-06 00:20:57,957 INFO L131 PetriNetUnfolder]: For 4099/4099 co-relation queries the response was YES. [2022-12-06 00:20:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3400 conditions, 593 events. 309/593 cut-off events. For 4099/4099 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2832 event pairs, 48 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 2841. Up to 519 conditions per place. [2022-12-06 00:20:57,962 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 72 selfloop transitions, 22 changer transitions 5/99 dead transitions. [2022-12-06 00:20:57,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 1237 flow [2022-12-06 00:20:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:20:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:20:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-12-06 00:20:57,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2681818181818182 [2022-12-06 00:20:57,964 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 739 flow. Second operand 10 states and 59 transitions. [2022-12-06 00:20:57,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 1237 flow [2022-12-06 00:20:57,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 1226 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:57,976 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 1040 flow [2022-12-06 00:20:57,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1040, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2022-12-06 00:20:57,976 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-06 00:20:57,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:57,977 INFO L89 Accepts]: Start accepts. Operand has 68 places, 76 transitions, 1040 flow [2022-12-06 00:20:57,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:57,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:57,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 76 transitions, 1040 flow [2022-12-06 00:20:57,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 76 transitions, 1040 flow [2022-12-06 00:20:58,029 INFO L130 PetriNetUnfolder]: 66/233 cut-off events. [2022-12-06 00:20:58,030 INFO L131 PetriNetUnfolder]: For 1474/1500 co-relation queries the response was YES. [2022-12-06 00:20:58,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 233 events. 66/233 cut-off events. For 1474/1500 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1339 event pairs, 2 based on Foata normal form. 6/229 useless extension candidates. Maximal degree in co-relation 1126. Up to 63 conditions per place. [2022-12-06 00:20:58,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 76 transitions, 1040 flow [2022-12-06 00:20:58,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 00:20:58,270 WARN L322 ript$VariableManager]: TermVariable LBE264 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:58,271 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:58,271 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:58,271 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:58,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] $Ultimate##0-->L49-5: Formula: (and (= v_~s~0_100 0) (= v_~x~0_97 (+ v_~x~0_98 v_~C~0_98)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0)) (= (+ v_~q_back~0_197 1) v_~q_back~0_196) (= |v_thread1Thread1of1ForFork0_~i~0#1_63| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (not (= (ite (and (<= 0 v_~q_back~0_197) (< v_~q_back~0_197 v_~n~0_121)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_174| v_~q~0.base_130) (+ (* v_~q_back~0_197 4) v_~q~0.offset_130)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (< |v_thread1Thread1of1ForFork0_~i~0#1_63| (+ 1 v_~N~0_85))) InVars {~q_back~0=v_~q_back~0_197, ~C~0=v_~C~0_98, #memory_int=|v_#memory_int_174|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_130, ~n~0=v_~n~0_121, ~q~0.offset=v_~q~0.offset_130, ~x~0=v_~x~0_98} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_67|, ~q_back~0=v_~q_back~0_196, ~C~0=v_~C~0_98, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_21|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_130, ~q~0.offset=v_~q~0.offset_130, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_21|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, #memory_int=|v_#memory_int_174|, ~n~0=v_~n~0_121, ~x~0=v_~x~0_97, ~s~0=v_~s~0_100} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0, ~s~0] and [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:58,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_227| v_~q~0.base_164)) (.cse1 (* v_~q_back~0_238 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_164)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_73| v_~N~0_103)) (< |v_thread1Thread1of1ForFork0_~i~0#1_73| (+ v_~N~0_103 1)) (= (+ 2 v_~q_back~0_238) v_~q_back~0_236) (not (= (ite (and (<= 0 v_~q_back~0_238) (< v_~q_back~0_238 v_~n~0_151)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_23| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| 0)) (= (+ (* 2 v_~C~0_128) v_~x~0_129) v_~x~0_127) (= v_~s~0_147 0) (not (= (ite (let ((.cse2 (+ v_~q_back~0_238 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_151))) 1 0) 0)) (= (ite (= 0 (select .cse0 (+ .cse1 v_~q~0.offset_164 4))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|) (= |v_thread1Thread1of1ForFork0_~i~0#1_73| 1) (= |v_thread1Thread1of1ForFork0_#res#1.offset_23| 0))) InVars {~q_back~0=v_~q_back~0_238, ~C~0=v_~C~0_128, #memory_int=|v_#memory_int_227|, ~N~0=v_~N~0_103, ~q~0.base=v_~q~0.base_164, ~n~0=v_~n~0_151, ~q~0.offset=v_~q~0.offset_164, ~x~0=v_~x~0_129} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_103|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_23|, ~q_back~0=v_~q_back~0_236, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_33|, ~C~0=v_~C~0_128, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_103, ~q~0.base=v_~q~0.base_164, ~q~0.offset=v_~q~0.offset_164, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_31|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54|, #memory_int=|v_#memory_int_227|, ~n~0=v_~n~0_151, ~x~0=v_~x~0_127, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_23|, ~s~0=v_~s~0_147} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x~0, thread1Thread1of1ForFork0_#res#1.base, ~s~0] and [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:20:59,015 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,015 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,384 WARN L322 ript$VariableManager]: TermVariable LBE51 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE259 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE264 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE263 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,385 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,386 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,386 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,968 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:20:59,968 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:00,269 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:21:00,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2294 [2022-12-06 00:21:00,270 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 1050 flow [2022-12-06 00:21:00,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:00,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:00,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:00,305 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 00:21:00,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 00:21:00,471 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 00:21:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:00,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1659194823, now seen corresponding path program 2 times [2022-12-06 00:21:00,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:00,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919345073] [2022-12-06 00:21:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:01,896 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 00:21:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:01,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919345073] [2022-12-06 00:21:01,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919345073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:01,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848261207] [2022-12-06 00:21:01,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:21:01,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:01,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:01,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:21:01,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:21:02,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:21:02,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:21:02,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 00:21:02,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:02,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 00:21:02,905 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 00:21:02,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:03,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:03,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-12-06 00:21:03,197 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 00:21:03,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848261207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:03,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:03,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:21:03,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649262370] [2022-12-06 00:21:03,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:03,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:21:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:21:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:21:03,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:21:03,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 1050 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 00:21:03,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:03,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:21:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:04,107 INFO L130 PetriNetUnfolder]: 337/652 cut-off events. [2022-12-06 00:21:04,108 INFO L131 PetriNetUnfolder]: For 5729/5729 co-relation queries the response was YES. [2022-12-06 00:21:04,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 652 events. 337/652 cut-off events. For 5729/5729 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3231 event pairs, 42 based on Foata normal form. 5/625 useless extension candidates. Maximal degree in co-relation 3852. Up to 547 conditions per place. [2022-12-06 00:21:04,114 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 73 selfloop transitions, 24 changer transitions 27/124 dead transitions. [2022-12-06 00:21:04,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 1566 flow [2022-12-06 00:21:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:21:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:21:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-12-06 00:21:04,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19675925925925927 [2022-12-06 00:21:04,116 INFO L175 Difference]: Start difference. First operand has 65 places, 74 transitions, 1050 flow. Second operand 16 states and 85 transitions. [2022-12-06 00:21:04,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 1566 flow [2022-12-06 00:21:04,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 124 transitions, 1496 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:04,140 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 1121 flow [2022-12-06 00:21:04,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1121, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2022-12-06 00:21:04,141 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 63 predicate places. [2022-12-06 00:21:04,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:04,141 INFO L89 Accepts]: Start accepts. Operand has 84 places, 80 transitions, 1121 flow [2022-12-06 00:21:04,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:04,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:04,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 80 transitions, 1121 flow [2022-12-06 00:21:04,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 80 transitions, 1121 flow [2022-12-06 00:21:04,175 INFO L130 PetriNetUnfolder]: 68/245 cut-off events. [2022-12-06 00:21:04,175 INFO L131 PetriNetUnfolder]: For 1744/1769 co-relation queries the response was YES. [2022-12-06 00:21:04,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 245 events. 68/245 cut-off events. For 1744/1769 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1412 event pairs, 3 based on Foata normal form. 6/244 useless extension candidates. Maximal degree in co-relation 1218. Up to 63 conditions per place. [2022-12-06 00:21:04,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 80 transitions, 1121 flow [2022-12-06 00:21:04,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 00:21:04,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] $Ultimate##0-->L70-2: Formula: (let ((.cse0 (select |v_#memory_int_231| v_~q~0.base_168))) (and (= (+ v_~x~0_140 v_~C~0_132) v_~x~0_139) (= v_~s~0_151 |v_thread2Thread1of1ForFork1_~j~0#1_107|) (< |v_thread1Thread1of1ForFork0_~i~0#1_79| (+ v_~N~0_107 1)) (= v_~y~0_149 (+ v_~y~0_150 v_~C~0_132)) (not (= (ite (and (< v_~q_back~0_249 v_~n~0_155) (<= 0 v_~q_back~0_249)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_79| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (+ v_~q_back~0_249 1) v_~q_back~0_248) (= (+ 1 v_~q_front~0_184) v_~q_front~0_183) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_107| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (select .cse0 (+ v_~q~0.offset_168 (* 4 v_~q_front~0_184))) |v_thread2Thread1of1ForFork1_~j~0#1_107|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_249 4) v_~q~0.offset_168)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (< v_~q_front~0_184 v_~n~0_155) (<= 0 v_~q_front~0_184) (< v_~q_front~0_184 v_~q_back~0_248)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|))) InVars {~q_back~0=v_~q_back~0_249, ~C~0=v_~C~0_132, #memory_int=|v_#memory_int_231|, ~N~0=v_~N~0_107, ~q~0.base=v_~q~0.base_168, ~y~0=v_~y~0_150, ~n~0=v_~n~0_155, ~q~0.offset=v_~q~0.offset_168, ~x~0=v_~x~0_140, ~q_front~0=v_~q_front~0_184} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_107|, ~q_back~0=v_~q_back~0_248, ~C~0=v_~C~0_132, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_62|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_31|, ~N~0=v_~N~0_107, ~q~0.base=v_~q~0.base_168, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_62|, ~q~0.offset=v_~q~0.offset_168, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_37|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, #memory_int=|v_#memory_int_231|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, ~y~0=v_~y~0_149, ~n~0=v_~n~0_155, ~x~0=v_~x~0_139, ~s~0=v_~s~0_151, ~q_front~0=v_~q_front~0_183} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ~s~0, ~q_front~0] and [564] L49-5-->L49-5: Formula: (and (= (+ v_~x~0_78 v_~C~0_70) v_~x~0_77) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (select (select |v_#memory_int_138| v_~q~0.base_100) (+ (* v_~q_back~0_163 4) v_~q~0.offset_100)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (< |v_thread1Thread1of1ForFork0_~i~0#1_46| v_~N~0_69) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| (+ |v_thread1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (not (= (ite (and (<= 0 v_~q_back~0_163) (< v_~q_back~0_163 v_~n~0_93)) 1 0) 0)) (= (+ v_~q_back~0_163 1) v_~q_back~0_162)) InVars {~q_back~0=v_~q_back~0_163, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_46|, #memory_int=|v_#memory_int_138|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~n~0=v_~n~0_93, ~q~0.offset=v_~q~0.offset_100, ~x~0=v_~x~0_78} OutVars{~q_back~0=v_~q_back~0_162, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~q~0.offset=v_~q~0.offset_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_21|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, #memory_int=|v_#memory_int_138|, ~n~0=v_~n~0_93, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0] [2022-12-06 00:21:04,185 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:04,185 WARN L322 ript$VariableManager]: TermVariable LBE264 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:04,185 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:04,185 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:04,185 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:04,185 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:04,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [564] L49-5-->L49-5: Formula: (and (= (+ v_~x~0_78 v_~C~0_70) v_~x~0_77) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (select (select |v_#memory_int_138| v_~q~0.base_100) (+ (* v_~q_back~0_163 4) v_~q~0.offset_100)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (< |v_thread1Thread1of1ForFork0_~i~0#1_46| v_~N~0_69) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| (+ |v_thread1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (not (= (ite (and (<= 0 v_~q_back~0_163) (< v_~q_back~0_163 v_~n~0_93)) 1 0) 0)) (= (+ v_~q_back~0_163 1) v_~q_back~0_162)) InVars {~q_back~0=v_~q_back~0_163, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_46|, #memory_int=|v_#memory_int_138|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~n~0=v_~n~0_93, ~q~0.offset=v_~q~0.offset_100, ~x~0=v_~x~0_78} OutVars{~q_back~0=v_~q_back~0_162, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~q~0.offset=v_~q~0.offset_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_21|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, #memory_int=|v_#memory_int_138|, ~n~0=v_~n~0_93, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0] [2022-12-06 00:21:05,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [564] L49-5-->L49-5: Formula: (and (= (+ v_~x~0_78 v_~C~0_70) v_~x~0_77) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (select (select |v_#memory_int_138| v_~q~0.base_100) (+ (* v_~q_back~0_163 4) v_~q~0.offset_100)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (< |v_thread1Thread1of1ForFork0_~i~0#1_46| v_~N~0_69) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| (+ |v_thread1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (not (= (ite (and (<= 0 v_~q_back~0_163) (< v_~q_back~0_163 v_~n~0_93)) 1 0) 0)) (= (+ v_~q_back~0_163 1) v_~q_back~0_162)) InVars {~q_back~0=v_~q_back~0_163, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_46|, #memory_int=|v_#memory_int_138|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~n~0=v_~n~0_93, ~q~0.offset=v_~q~0.offset_100, ~x~0=v_~x~0_78} OutVars{~q_back~0=v_~q_back~0_162, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~q~0.offset=v_~q~0.offset_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_21|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, #memory_int=|v_#memory_int_138|, ~n~0=v_~n~0_93, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0] [2022-12-06 00:21:06,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] $Ultimate##0-->L49-5: Formula: (let ((.cse0 (+ 1 v_~q_front~0_213)) (.cse1 (select |v_#memory_int_242| v_~q~0.base_178))) (and (= (ite (and (< v_~q_front~0_213 v_~n~0_165) (<= 0 v_~q_front~0_213) (< .cse0 v_~q_back~0_266)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_81|) (= (select .cse1 (+ (* 4 v_~q_front~0_213) v_~q~0.offset_178)) |v_thread2Thread1of1ForFork1_~j~0#1_131|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_131| 0)) (= v_~y~0_179 (+ v_~y~0_180 v_~C~0_142)) (not (= (ite (and (<= 1 v_~q_back~0_266) (< v_~q_back~0_266 (+ v_~n~0_165 1))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_81| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_81|) (< 1 v_~N~0_113) (= (+ 2 v_~q_back~0_268) v_~q_back~0_266) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (= .cse0 v_~q_front~0_212) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_81| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_87| 2) (= (ite (= (select .cse1 (+ (* v_~q_back~0_266 4) (- 4) v_~q~0.offset_178)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (= v_~s~0_180 |v_thread2Thread1of1ForFork1_~j~0#1_131|) (= (+ (* 2 v_~C~0_142) v_~x~0_157) v_~x~0_155) (not (= (ite (= (select .cse1 (+ (* v_~q_back~0_268 4) v_~q~0.offset_178)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|))) InVars {~q_back~0=v_~q_back~0_268, ~C~0=v_~C~0_142, #memory_int=|v_#memory_int_242|, ~N~0=v_~N~0_113, ~q~0.base=v_~q~0.base_178, ~n~0=v_~n~0_165, ~y~0=v_~y~0_180, ~q~0.offset=v_~q~0.offset_178, ~x~0=v_~x~0_157, ~q_front~0=v_~q_front~0_213} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_131|, ~q_back~0=v_~q_back~0_266, ~C~0=v_~C~0_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_81|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_39|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_81|, ~N~0=v_~N~0_113, ~q~0.base=v_~q~0.base_178, ~q~0.offset=v_~q~0.offset_178, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_81|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_81|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_45|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_39|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, #memory_int=|v_#memory_int_242|, ~n~0=v_~n~0_165, ~y~0=v_~y~0_179, ~x~0=v_~x~0_155, ~s~0=v_~s~0_180, ~q_front~0=v_~q_front~0_212} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ~s~0, ~q_front~0] and [576] L70-2-->thread2EXIT: Formula: (and (= (+ v_~s~0_In_5 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= (+ v_~y~0_In_6 v_~C~0_In_7) v_~y~0_Out_18) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| (select (select |v_#memory_int_In_22| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4)))) (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_22) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_6| 0) (= |v_thread2Thread1of1ForFork1_~j~0#1_Out_4| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|) (= (ite (and (<= 0 v_~q_front~0_In_4) (< v_~q_front~0_In_4 v_~n~0_In_9) (< v_~q_front~0_In_4 v_~q_back~0_In_6)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_6| 0)) InVars {~q_back~0=v_~q_back~0_In_6, ~C~0=v_~C~0_In_7, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_22|, ~y~0=v_~y~0_In_6, ~n~0=v_~n~0_In_9, ~s~0=v_~s~0_In_5, ~q_front~0=v_~q_front~0_In_4} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_Out_4|, ~q_back~0=v_~q_back~0_In_6, ~C~0=v_~C~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_6|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~q~0.base=v_~q~0.base_In_6, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_4|, ~q~0.offset=v_~q~0.offset_In_6, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_6|, #memory_int=|v_#memory_int_In_22|, ~y~0=v_~y~0_Out_18, ~n~0=v_~n~0_In_9, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:21:06,805 WARN L322 ript$VariableManager]: TermVariable LBE264 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:06,806 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:06,806 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:06,806 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:07,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] $Ultimate##0-->L49-5: Formula: (let ((.cse0 (+ 1 v_~q_front~0_213)) (.cse1 (select |v_#memory_int_242| v_~q~0.base_178))) (and (= (ite (and (< v_~q_front~0_213 v_~n~0_165) (<= 0 v_~q_front~0_213) (< .cse0 v_~q_back~0_266)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_81|) (= (select .cse1 (+ (* 4 v_~q_front~0_213) v_~q~0.offset_178)) |v_thread2Thread1of1ForFork1_~j~0#1_131|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_131| 0)) (= v_~y~0_179 (+ v_~y~0_180 v_~C~0_142)) (not (= (ite (and (<= 1 v_~q_back~0_266) (< v_~q_back~0_266 (+ v_~n~0_165 1))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_81| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_81|) (< 1 v_~N~0_113) (= (+ 2 v_~q_back~0_268) v_~q_back~0_266) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (= .cse0 v_~q_front~0_212) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_81| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_87| 2) (= (ite (= (select .cse1 (+ (* v_~q_back~0_266 4) (- 4) v_~q~0.offset_178)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (= v_~s~0_180 |v_thread2Thread1of1ForFork1_~j~0#1_131|) (= (+ (* 2 v_~C~0_142) v_~x~0_157) v_~x~0_155) (not (= (ite (= (select .cse1 (+ (* v_~q_back~0_268 4) v_~q~0.offset_178)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|))) InVars {~q_back~0=v_~q_back~0_268, ~C~0=v_~C~0_142, #memory_int=|v_#memory_int_242|, ~N~0=v_~N~0_113, ~q~0.base=v_~q~0.base_178, ~n~0=v_~n~0_165, ~y~0=v_~y~0_180, ~q~0.offset=v_~q~0.offset_178, ~x~0=v_~x~0_157, ~q_front~0=v_~q_front~0_213} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_131|, ~q_back~0=v_~q_back~0_266, ~C~0=v_~C~0_142, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_81|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_39|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_81|, ~N~0=v_~N~0_113, ~q~0.base=v_~q~0.base_178, ~q~0.offset=v_~q~0.offset_178, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_81|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_81|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_45|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_39|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, #memory_int=|v_#memory_int_242|, ~n~0=v_~n~0_165, ~y~0=v_~y~0_179, ~x~0=v_~x~0_155, ~s~0=v_~s~0_180, ~q_front~0=v_~q_front~0_212} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ~s~0, ~q_front~0] and [546] L70-2-->L70-2: Formula: (and (= (+ v_~q_front~0_77 1) v_~q_front~0_76) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_35| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= v_~s~0_40 (+ v_~s~0_41 |v_thread2Thread1of1ForFork1_~j~0#1_35|)) (= (select (select |v_#memory_int_96| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_77 4))) |v_thread2Thread1of1ForFork1_~j~0#1_35|) (= v_~y~0_43 (+ v_~y~0_44 v_~C~0_46)) (= (ite (and (< v_~q_front~0_77 v_~n~0_67) (<= 0 v_~q_front~0_77) (< v_~q_front~0_77 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0))) InVars {~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, #memory_int=|v_#memory_int_96|, ~q~0.base=v_~q~0.base_68, ~y~0=v_~y~0_44, ~n~0=v_~n~0_67, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_41, ~q_front~0=v_~q_front~0_77} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_35|, ~q_back~0=v_~q_back~0_120, ~C~0=v_~C~0_46, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_19|, ~q~0.base=v_~q~0.base_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_19|, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_96|, ~y~0=v_~y~0_43, ~n~0=v_~n~0_67, ~s~0=v_~s~0_40, ~q_front~0=v_~q_front~0_76} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~y~0, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 00:21:07,627 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:21:07,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3486 [2022-12-06 00:21:07,628 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 1148 flow [2022-12-06 00:21:07,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 00:21:07,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:07,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:07,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:21:07,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 00:21:07,829 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 00:21:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1884348560, now seen corresponding path program 1 times [2022-12-06 00:21:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:07,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429217930] [2022-12-06 00:21:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:08,168 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 00:21:08,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:08,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429217930] [2022-12-06 00:21:08,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429217930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:08,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:08,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800376508] [2022-12-06 00:21:08,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:08,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:08,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:08,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:21:08,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:08,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:08,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:21:08,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:08,387 INFO L130 PetriNetUnfolder]: 345/640 cut-off events. [2022-12-06 00:21:08,387 INFO L131 PetriNetUnfolder]: For 6486/6486 co-relation queries the response was YES. [2022-12-06 00:21:08,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4095 conditions, 640 events. 345/640 cut-off events. For 6486/6486 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3004 event pairs, 42 based on Foata normal form. 12/631 useless extension candidates. Maximal degree in co-relation 4037. Up to 408 conditions per place. [2022-12-06 00:21:08,394 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 59 selfloop transitions, 42 changer transitions 4/105 dead transitions. [2022-12-06 00:21:08,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 1628 flow [2022-12-06 00:21:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:21:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:21:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 00:21:08,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38125 [2022-12-06 00:21:08,395 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 1148 flow. Second operand 5 states and 61 transitions. [2022-12-06 00:21:08,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 1628 flow [2022-12-06 00:21:08,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 1459 flow, removed 71 selfloop flow, removed 10 redundant places. [2022-12-06 00:21:08,419 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 1241 flow [2022-12-06 00:21:08,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1241, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2022-12-06 00:21:08,420 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-06 00:21:08,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:08,420 INFO L89 Accepts]: Start accepts. Operand has 71 places, 84 transitions, 1241 flow [2022-12-06 00:21:08,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:08,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:08,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 84 transitions, 1241 flow [2022-12-06 00:21:08,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 84 transitions, 1241 flow [2022-12-06 00:21:08,455 INFO L130 PetriNetUnfolder]: 82/262 cut-off events. [2022-12-06 00:21:08,455 INFO L131 PetriNetUnfolder]: For 1820/1856 co-relation queries the response was YES. [2022-12-06 00:21:08,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 262 events. 82/262 cut-off events. For 1820/1856 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1456 event pairs, 2 based on Foata normal form. 5/255 useless extension candidates. Maximal degree in co-relation 1323. Up to 75 conditions per place. [2022-12-06 00:21:08,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 84 transitions, 1241 flow [2022-12-06 00:21:08,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 00:21:08,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L70-2: Formula: (let ((.cse1 (select |v_#memory_int_254| v_~q~0.base_190))) (let ((.cse2 (* 2 v_~C~0_154)) (.cse0 (select .cse1 (+ v_~q~0.offset_190 (* 4 v_~q_front~0_240)))) (.cse3 (+ v_~n~0_177 1))) (and (= (+ .cse0 |v_thread2Thread1of1ForFork1_~j~0#1_145|) v_~s~0_198) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_145| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= (select .cse1 (+ (- 4) (* 4 v_~q_front~0_238) v_~q~0.offset_190)) |v_thread2Thread1of1ForFork1_~j~0#1_145|) (= (+ .cse2 v_~x~0_186) v_~x~0_185) (= v_~y~0_205 (+ v_~y~0_207 .cse2)) (= (ite (= (select .cse1 (+ (- 4) v_~q~0.offset_190 (* v_~q_back~0_296 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< v_~q_front~0_240 v_~n~0_177) (< (+ 1 v_~q_front~0_240) v_~q_back~0_296) (<= 0 v_~q_front~0_240)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95| (ite (and (< v_~q_front~0_238 (+ v_~q_back~0_296 1)) (<= 1 v_~q_front~0_238) (< v_~q_front~0_238 .cse3)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (= (+ 2 v_~q_back~0_297) v_~q_back~0_296) (< 1 v_~N~0_125) (= (+ 2 v_~q_front~0_240) v_~q_front~0_238) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_107| 2) (not (= .cse0 0)) (not (= (ite (and (<= 1 v_~q_back~0_296) (< v_~q_back~0_296 .cse3)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_190 (* v_~q_back~0_297 4))) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_297, ~C~0=v_~C~0_154, #memory_int=|v_#memory_int_254|, ~N~0=v_~N~0_125, ~q~0.base=v_~q~0.base_190, ~y~0=v_~y~0_207, ~n~0=v_~n~0_177, ~q~0.offset=v_~q~0.offset_190, ~x~0=v_~x~0_186, ~q_front~0=v_~q_front~0_240} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_145|, ~q_back~0=v_~q_back~0_296, ~C~0=v_~C~0_154, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_95|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_55|, ~N~0=v_~N~0_125, ~q~0.base=v_~q~0.base_190, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_95|, ~q~0.offset=v_~q~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_61|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_107|, #memory_int=|v_#memory_int_254|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, ~y~0=v_~y~0_205, ~n~0=v_~n~0_177, ~x~0=v_~x~0_185, ~s~0=v_~s~0_198, ~q_front~0=v_~q_front~0_238} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ~s~0, ~q_front~0] and [564] L49-5-->L49-5: Formula: (and (= (+ v_~x~0_78 v_~C~0_70) v_~x~0_77) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (select (select |v_#memory_int_138| v_~q~0.base_100) (+ (* v_~q_back~0_163 4) v_~q~0.offset_100)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (< |v_thread1Thread1of1ForFork0_~i~0#1_46| v_~N~0_69) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| (+ |v_thread1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (not (= (ite (and (<= 0 v_~q_back~0_163) (< v_~q_back~0_163 v_~n~0_93)) 1 0) 0)) (= (+ v_~q_back~0_163 1) v_~q_back~0_162)) InVars {~q_back~0=v_~q_back~0_163, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_46|, #memory_int=|v_#memory_int_138|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~n~0=v_~n~0_93, ~q~0.offset=v_~q~0.offset_100, ~x~0=v_~x~0_78} OutVars{~q_back~0=v_~q_back~0_162, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~q~0.offset=v_~q~0.offset_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_21|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, #memory_int=|v_#memory_int_138|, ~n~0=v_~n~0_93, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0] [2022-12-06 00:21:08,467 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,467 WARN L322 ript$VariableManager]: TermVariable LBE264 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,468 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,468 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,468 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,468 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L70-2: Formula: (let ((.cse1 (select |v_#memory_int_254| v_~q~0.base_190))) (let ((.cse2 (* 2 v_~C~0_154)) (.cse0 (select .cse1 (+ v_~q~0.offset_190 (* 4 v_~q_front~0_240)))) (.cse3 (+ v_~n~0_177 1))) (and (= (+ .cse0 |v_thread2Thread1of1ForFork1_~j~0#1_145|) v_~s~0_198) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_145| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= (select .cse1 (+ (- 4) (* 4 v_~q_front~0_238) v_~q~0.offset_190)) |v_thread2Thread1of1ForFork1_~j~0#1_145|) (= (+ .cse2 v_~x~0_186) v_~x~0_185) (= v_~y~0_205 (+ v_~y~0_207 .cse2)) (= (ite (= (select .cse1 (+ (- 4) v_~q~0.offset_190 (* v_~q_back~0_296 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< v_~q_front~0_240 v_~n~0_177) (< (+ 1 v_~q_front~0_240) v_~q_back~0_296) (<= 0 v_~q_front~0_240)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95| (ite (and (< v_~q_front~0_238 (+ v_~q_back~0_296 1)) (<= 1 v_~q_front~0_238) (< v_~q_front~0_238 .cse3)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (= (+ 2 v_~q_back~0_297) v_~q_back~0_296) (< 1 v_~N~0_125) (= (+ 2 v_~q_front~0_240) v_~q_front~0_238) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_107| 2) (not (= .cse0 0)) (not (= (ite (and (<= 1 v_~q_back~0_296) (< v_~q_back~0_296 .cse3)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_190 (* v_~q_back~0_297 4))) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_297, ~C~0=v_~C~0_154, #memory_int=|v_#memory_int_254|, ~N~0=v_~N~0_125, ~q~0.base=v_~q~0.base_190, ~y~0=v_~y~0_207, ~n~0=v_~n~0_177, ~q~0.offset=v_~q~0.offset_190, ~x~0=v_~x~0_186, ~q_front~0=v_~q_front~0_240} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_145|, ~q_back~0=v_~q_back~0_296, ~C~0=v_~C~0_154, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_95|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_55|, ~N~0=v_~N~0_125, ~q~0.base=v_~q~0.base_190, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_95|, ~q~0.offset=v_~q~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_61|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_107|, #memory_int=|v_#memory_int_254|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, ~y~0=v_~y~0_205, ~n~0=v_~n~0_177, ~x~0=v_~x~0_185, ~s~0=v_~s~0_198, ~q_front~0=v_~q_front~0_238} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ~s~0, ~q_front~0] and [564] L49-5-->L49-5: Formula: (and (= (+ v_~x~0_78 v_~C~0_70) v_~x~0_77) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (select (select |v_#memory_int_138| v_~q~0.base_100) (+ (* v_~q_back~0_163 4) v_~q~0.offset_100)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (< |v_thread1Thread1of1ForFork0_~i~0#1_46| v_~N~0_69) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| (+ |v_thread1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (not (= (ite (and (<= 0 v_~q_back~0_163) (< v_~q_back~0_163 v_~n~0_93)) 1 0) 0)) (= (+ v_~q_back~0_163 1) v_~q_back~0_162)) InVars {~q_back~0=v_~q_back~0_163, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_46|, #memory_int=|v_#memory_int_138|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~n~0=v_~n~0_93, ~q~0.offset=v_~q~0.offset_100, ~x~0=v_~x~0_78} OutVars{~q_back~0=v_~q_back~0_162, ~C~0=v_~C~0_70, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_17|, ~N~0=v_~N~0_69, ~q~0.base=v_~q~0.base_100, ~q~0.offset=v_~q~0.offset_100, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_21|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_17|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, #memory_int=|v_#memory_int_138|, ~n~0=v_~n~0_93, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~x~0] [2022-12-06 00:21:08,976 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,976 WARN L322 ript$VariableManager]: TermVariable LBE264 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,976 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,976 WARN L322 ript$VariableManager]: TermVariable LBE91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,976 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:08,976 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:21:09,476 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 00:21:09,482 INFO L158 Benchmark]: Toolchain (without parser) took 43239.08ms. Allocated memory was 179.3MB in the beginning and 458.2MB in the end (delta: 278.9MB). Free memory was 137.8MB in the beginning and 420.8MB in the end (delta: -283.0MB). Peak memory consumption was 261.2MB. Max. memory is 8.0GB. [2022-12-06 00:21:09,482 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory was 155.9MB in the beginning and 155.9MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:21:09,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.92ms. Allocated memory is still 179.3MB. Free memory was 137.8MB in the beginning and 125.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:21:09,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.17ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:21:09,482 INFO L158 Benchmark]: Boogie Preprocessor took 28.85ms. Allocated memory is still 179.3MB. Free memory was 123.6MB in the beginning and 122.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:21:09,483 INFO L158 Benchmark]: RCFGBuilder took 668.21ms. Allocated memory is still 179.3MB. Free memory was 122.1MB in the beginning and 97.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 00:21:09,483 INFO L158 Benchmark]: TraceAbstraction took 42207.87ms. Allocated memory was 179.3MB in the beginning and 458.2MB in the end (delta: 278.9MB). Free memory was 97.4MB in the beginning and 420.8MB in the end (delta: -323.4MB). Peak memory consumption was 220.3MB. Max. memory is 8.0GB. [2022-12-06 00:21:09,484 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.13ms. Allocated memory is still 179.3MB. Free memory was 155.9MB in the beginning and 155.9MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.92ms. Allocated memory is still 179.3MB. Free memory was 137.8MB in the beginning and 125.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.17ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.85ms. Allocated memory is still 179.3MB. Free memory was 123.6MB in the beginning and 122.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 668.21ms. Allocated memory is still 179.3MB. Free memory was 122.1MB in the beginning and 97.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 42207.87ms. Allocated memory was 179.3MB in the beginning and 458.2MB in the end (delta: 278.9MB). Free memory was 97.4MB in the beginning and 420.8MB in the end (delta: -323.4MB). Peak memory consumption was 220.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 119 PlacesBefore, 21 PlacesAfterwards, 123 TransitionsBefore, 17 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 75 TrivialYvCompositions, 23 ConcurrentYvCompositions, 7 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 402, independent conditional: 402, 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: 405, independent: 402, independent conditional: 0, independent unconditional: 402, 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: 405, independent: 402, independent conditional: 0, independent unconditional: 402, 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: 405, independent: 402, independent conditional: 0, independent unconditional: 402, 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: 394, independent: 391, independent conditional: 0, independent unconditional: 391, 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: 394, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 405, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 394, unknown conditional: 0, unknown unconditional: 394] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 650, Positive conditional cache size: 0, Positive unconditional cache size: 650, 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: 1.1s, 21 PlacesBefore, 20 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 28 PlacesBefore, 27 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, 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: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 32 PlacesBefore, 31 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 3, independent unconditional: 1, 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: 15, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 3, Positive unconditional cache size: 8, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 24 TransitionsBefore, 24 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): 11, Positive cache size: 11, Positive conditional cache size: 3, Positive unconditional cache size: 8, 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: 1.3s, 29 PlacesBefore, 28 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 11, Positive cache size: 11, Positive conditional cache size: 3, Positive unconditional cache size: 8, 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: 3.3s, 33 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 11, Positive cache size: 11, Positive conditional cache size: 3, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 100 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): 11, Positive cache size: 11, Positive conditional cache size: 3, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 41 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 12, 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: 16, independent: 16, independent conditional: 12, 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: 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: 16, independent: 14, independent conditional: 10, independent unconditional: 4, 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): 13, Positive cache size: 13, Positive conditional cache size: 5, Positive unconditional cache size: 8, 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: 2.9s, 48 PlacesBefore, 48 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 13, Positive cache size: 13, Positive conditional cache size: 5, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 62 TransitionsBefore, 62 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): 13, Positive cache size: 13, Positive conditional cache size: 5, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 54 PlacesBefore, 53 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 10, Positive unconditional cache size: 8, 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, 50 PlacesBefore, 50 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 194 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): 18, Positive cache size: 18, Positive conditional cache size: 10, Positive unconditional cache size: 8, 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, 57 PlacesBefore, 56 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 224 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): 21, Positive cache size: 21, Positive conditional cache size: 13, Positive unconditional cache size: 8, 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, 55 PlacesBefore, 55 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 206 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): 21, Positive cache size: 21, Positive conditional cache size: 13, Positive unconditional cache size: 8, 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: 2.2s, 67 PlacesBefore, 65 PlacesAfterwards, 76 TransitionsBefore, 74 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 55, Positive conditional cache size: 47, Positive unconditional cache size: 8, 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: 3.4s, 77 PlacesBefore, 75 PlacesAfterwards, 80 TransitionsBefore, 78 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 4, independent conditional: 4, 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): 58, Positive cache size: 58, Positive conditional cache size: 50, Positive unconditional cache size: 8, 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 00:21:09,512 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...