/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:39:54,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:39:54,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:39:54,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:39:54,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:39:54,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:39:54,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:39:54,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:39:54,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:39:54,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:39:54,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:39:54,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:39:54,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:39:54,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:39:54,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:39:54,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:39:54,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:39:54,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:39:54,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:39:54,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:39:54,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:39:54,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:39:54,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:39:54,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:39:54,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:39:54,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:39:54,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:39:54,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:39:54,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:39:54,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:39:54,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:39:54,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:39:54,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:39:54,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:39:54,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:39:54,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:39:54,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:39:54,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:39:54,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:39:54,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:39:54,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:39:54,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:39:54,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:39:54,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:39:54,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:39:54,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:39:54,154 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:39:54,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:39:54,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:39:54,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:39:54,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:39:54,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:39:54,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:39:54,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:39:54,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:39:54,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:39:54,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:39:54,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:39:54,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:39:54,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:39:54,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:39:54,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:39:54,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:39:54,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:39:54,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:39:54,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:39:54,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:39:54,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:39:54,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:39:54,413 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:39:54,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-06 05:39:55,250 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:39:55,413 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:39:55,413 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-12-06 05:39:55,418 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947007386/745b4077d23f4c37abad48842240f374/FLAGa7daae1a9 [2022-12-06 05:39:55,436 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947007386/745b4077d23f4c37abad48842240f374 [2022-12-06 05:39:55,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:39:55,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:39:55,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:39:55,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:39:55,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:39:55,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f41ae48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55, skipping insertion in model container [2022-12-06 05:39:55,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:39:55,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:39:55,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:39:55,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:39:55,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:39:55,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:39:55,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:39:55,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:39:55,568 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-queue-add-2.wvr.c[2696,2709] [2022-12-06 05:39:55,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:39:55,578 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:39:55,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:39:55,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:39:55,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:39:55,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:39:55,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:39:55,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:39:55,601 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-queue-add-2.wvr.c[2696,2709] [2022-12-06 05:39:55,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:39:55,613 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:39:55,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55 WrapperNode [2022-12-06 05:39:55,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:39:55,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:39:55,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:39:55,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:39:55,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,657 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2022-12-06 05:39:55,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:39:55,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:39:55,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:39:55,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:39:55,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,690 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:39:55,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:39:55,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:39:55,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:39:55,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (1/1) ... [2022-12-06 05:39:55,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:39:55,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:55,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:39:55,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:39:55,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:39:55,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:39:55,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:39:55,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:39:55,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:39:55,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:39:55,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:39:55,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:39:55,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:39:55,762 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:39:55,845 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:39:55,846 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:39:56,063 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:39:56,148 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:39:56,148 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:39:56,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:56 BoogieIcfgContainer [2022-12-06 05:39:56,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:39:56,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:39:56,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:39:56,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:39:56,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:39:55" (1/3) ... [2022-12-06 05:39:56,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7574005f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:39:56, skipping insertion in model container [2022-12-06 05:39:56,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:55" (2/3) ... [2022-12-06 05:39:56,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7574005f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:39:56, skipping insertion in model container [2022-12-06 05:39:56,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:56" (3/3) ... [2022-12-06 05:39:56,155 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-12-06 05:39:56,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:39:56,166 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:39:56,166 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:39:56,205 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:39:56,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 264 flow [2022-12-06 05:39:56,287 INFO L130 PetriNetUnfolder]: 11/122 cut-off events. [2022-12-06 05:39:56,287 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:39:56,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 122 events. 11/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2022-12-06 05:39:56,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 264 flow [2022-12-06 05:39:56,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 114 transitions, 240 flow [2022-12-06 05:39:56,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:56,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-06 05:39:56,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 114 transitions, 240 flow [2022-12-06 05:39:56,360 INFO L130 PetriNetUnfolder]: 11/114 cut-off events. [2022-12-06 05:39:56,361 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:39:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 11/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 89. Up to 3 conditions per place. [2022-12-06 05:39:56,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 114 transitions, 240 flow [2022-12-06 05:39:56,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-06 05:40:00,607 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 05:40:00,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:40:00,621 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;@1ca2da71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:40:00,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:40:00,624 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:40:00,624 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:40:00,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:00,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:00,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 82611840, now seen corresponding path program 1 times [2022-12-06 05:40:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:00,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338870970] [2022-12-06 05:40:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:00,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:00,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338870970] [2022-12-06 05:40:00,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338870970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:00,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:00,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718462251] [2022-12-06 05:40:00,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:00,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:00,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:40:00,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 05:40:00,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:00,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:40:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:00,989 INFO L130 PetriNetUnfolder]: 45/87 cut-off events. [2022-12-06 05:40:00,990 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:40:00,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 87 events. 45/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 190 event pairs, 18 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 05:40:00,991 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 14 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2022-12-06 05:40:00,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 106 flow [2022-12-06 05:40:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:40:00,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 05:40:00,999 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:40:01,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 106 flow [2022-12-06 05:40:01,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:01,002 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 58 flow [2022-12-06 05:40:01,003 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 05:40:01,005 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2022-12-06 05:40:01,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:01,006 INFO L89 Accepts]: Start accepts. Operand has 22 places, 18 transitions, 58 flow [2022-12-06 05:40:01,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:01,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:01,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 58 flow [2022-12-06 05:40:01,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 58 flow [2022-12-06 05:40:01,012 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-06 05:40:01,012 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:40:01,012 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 05:40:01,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 18 transitions, 58 flow [2022-12-06 05:40:01,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 05:40:01,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:01,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 747 [2022-12-06 05:40:01,752 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 54 flow [2022-12-06 05:40:01,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 05:40:01,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:01,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:01,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:40:01,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1818505939, now seen corresponding path program 1 times [2022-12-06 05:40:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:01,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324507185] [2022-12-06 05:40:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:01,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324507185] [2022-12-06 05:40:01,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324507185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:01,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:01,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:01,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532169196] [2022-12-06 05:40:01,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:01,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:40:01,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:01,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:40:01,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:40:01,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 05:40:01,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 54 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 05:40:01,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:01,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 05:40:01,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:02,083 INFO L130 PetriNetUnfolder]: 72/135 cut-off events. [2022-12-06 05:40:02,083 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 05:40:02,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 135 events. 72/135 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 411 event pairs, 9 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 350. Up to 77 conditions per place. [2022-12-06 05:40:02,084 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 31 selfloop transitions, 8 changer transitions 2/42 dead transitions. [2022-12-06 05:40:02,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 42 transitions, 212 flow [2022-12-06 05:40:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:40:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:40:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 05:40:02,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 05:40:02,086 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 54 flow. Second operand 6 states and 48 transitions. [2022-12-06 05:40:02,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 42 transitions, 212 flow [2022-12-06 05:40:02,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 204 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:02,087 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 104 flow [2022-12-06 05:40:02,087 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2022-12-06 05:40:02,088 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:40:02,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:02,088 INFO L89 Accepts]: Start accepts. Operand has 26 places, 23 transitions, 104 flow [2022-12-06 05:40:02,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:02,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:02,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 23 transitions, 104 flow [2022-12-06 05:40:02,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 104 flow [2022-12-06 05:40:02,093 INFO L130 PetriNetUnfolder]: 16/50 cut-off events. [2022-12-06 05:40:02,093 INFO L131 PetriNetUnfolder]: For 14/26 co-relation queries the response was YES. [2022-12-06 05:40:02,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 50 events. 16/50 cut-off events. For 14/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 3 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 89. Up to 28 conditions per place. [2022-12-06 05:40:02,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 104 flow [2022-12-06 05:40:02,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 05:40:02,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L47-4: 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 [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:02,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:02,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 05:40:02,302 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 110 flow [2022-12-06 05:40:02,302 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 05:40:02,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:02,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:02,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:40:02,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2133734352, now seen corresponding path program 1 times [2022-12-06 05:40:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:02,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135913473] [2022-12-06 05:40:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:02,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135913473] [2022-12-06 05:40:02,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135913473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:02,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:02,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242069142] [2022-12-06 05:40:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:02,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:02,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 05:40:02,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:02,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:02,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 05:40:02,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:02,433 INFO L130 PetriNetUnfolder]: 87/180 cut-off events. [2022-12-06 05:40:02,433 INFO L131 PetriNetUnfolder]: For 168/206 co-relation queries the response was YES. [2022-12-06 05:40:02,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 180 events. 87/180 cut-off events. For 168/206 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 658 event pairs, 12 based on Foata normal form. 23/176 useless extension candidates. Maximal degree in co-relation 493. Up to 109 conditions per place. [2022-12-06 05:40:02,434 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 29 selfloop transitions, 9 changer transitions 3/42 dead transitions. [2022-12-06 05:40:02,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 254 flow [2022-12-06 05:40:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:40:02,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 05:40:02,435 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 110 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:40:02,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 254 flow [2022-12-06 05:40:02,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 237 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:02,437 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 151 flow [2022-12-06 05:40:02,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-06 05:40:02,438 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 8 predicate places. [2022-12-06 05:40:02,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:02,438 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 151 flow [2022-12-06 05:40:02,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:02,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:02,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 151 flow [2022-12-06 05:40:02,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 151 flow [2022-12-06 05:40:02,444 INFO L130 PetriNetUnfolder]: 18/63 cut-off events. [2022-12-06 05:40:02,444 INFO L131 PetriNetUnfolder]: For 55/69 co-relation queries the response was YES. [2022-12-06 05:40:02,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 63 events. 18/63 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 175 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 193. Up to 37 conditions per place. [2022-12-06 05:40:02,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 151 flow [2022-12-06 05:40:02,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 05:40:02,445 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:02,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:40:02,446 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 151 flow [2022-12-06 05:40:02,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:02,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:02,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:02,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:40:02,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash -890155735, now seen corresponding path program 1 times [2022-12-06 05:40:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:02,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233149589] [2022-12-06 05:40:02,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:02,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:02,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233149589] [2022-12-06 05:40:02,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233149589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:02,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:02,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194467567] [2022-12-06 05:40:02,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:02,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:02,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 05:40:02,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:02,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:02,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 05:40:02,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:02,602 INFO L130 PetriNetUnfolder]: 82/181 cut-off events. [2022-12-06 05:40:02,602 INFO L131 PetriNetUnfolder]: For 364/370 co-relation queries the response was YES. [2022-12-06 05:40:02,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 181 events. 82/181 cut-off events. For 364/370 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 607 event pairs, 36 based on Foata normal form. 14/167 useless extension candidates. Maximal degree in co-relation 716. Up to 158 conditions per place. [2022-12-06 05:40:02,604 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 23 selfloop transitions, 2 changer transitions 11/37 dead transitions. [2022-12-06 05:40:02,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 269 flow [2022-12-06 05:40:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-06 05:40:02,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-06 05:40:02,605 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 151 flow. Second operand 5 states and 35 transitions. [2022-12-06 05:40:02,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 269 flow [2022-12-06 05:40:02,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 237 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:02,607 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 145 flow [2022-12-06 05:40:02,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 05:40:02,608 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2022-12-06 05:40:02,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:02,608 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 145 flow [2022-12-06 05:40:02,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:02,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:02,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 145 flow [2022-12-06 05:40:02,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 145 flow [2022-12-06 05:40:02,614 INFO L130 PetriNetUnfolder]: 18/64 cut-off events. [2022-12-06 05:40:02,614 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-06 05:40:02,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 64 events. 18/64 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 167 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 171. Up to 23 conditions per place. [2022-12-06 05:40:02,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 145 flow [2022-12-06 05:40:02,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 05:40:03,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:03,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 870 [2022-12-06 05:40:03,478 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 141 flow [2022-12-06 05:40:03,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:03,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:03,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:03,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:40:03,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:03,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1895879813, now seen corresponding path program 1 times [2022-12-06 05:40:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:03,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556334527] [2022-12-06 05:40:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556334527] [2022-12-06 05:40:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556334527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:03,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:03,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319415782] [2022-12-06 05:40:03,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:03,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:03,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:03,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 05:40:03,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:03,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:03,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 05:40:03,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:04,124 INFO L130 PetriNetUnfolder]: 112/229 cut-off events. [2022-12-06 05:40:04,124 INFO L131 PetriNetUnfolder]: For 302/308 co-relation queries the response was YES. [2022-12-06 05:40:04,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 229 events. 112/229 cut-off events. For 302/308 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 840 event pairs, 19 based on Foata normal form. 12/199 useless extension candidates. Maximal degree in co-relation 857. Up to 168 conditions per place. [2022-12-06 05:40:04,126 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 40 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2022-12-06 05:40:04,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 362 flow [2022-12-06 05:40:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:40:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:40:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-06 05:40:04,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 05:40:04,127 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 141 flow. Second operand 7 states and 51 transitions. [2022-12-06 05:40:04,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 362 flow [2022-12-06 05:40:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 52 transitions, 330 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:04,129 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 241 flow [2022-12-06 05:40:04,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2022-12-06 05:40:04,130 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:40:04,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:04,130 INFO L89 Accepts]: Start accepts. Operand has 36 places, 35 transitions, 241 flow [2022-12-06 05:40:04,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:04,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:04,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions, 241 flow [2022-12-06 05:40:04,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 241 flow [2022-12-06 05:40:04,138 INFO L130 PetriNetUnfolder]: 26/91 cut-off events. [2022-12-06 05:40:04,138 INFO L131 PetriNetUnfolder]: For 121/143 co-relation queries the response was YES. [2022-12-06 05:40:04,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 91 events. 26/91 cut-off events. For 121/143 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 311 event pairs, 0 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 180. Up to 31 conditions per place. [2022-12-06 05:40:04,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 35 transitions, 241 flow [2022-12-06 05:40:04,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 05:40:06,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:40:06,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:06,480 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:06,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2351 [2022-12-06 05:40:06,481 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 257 flow [2022-12-06 05:40:06,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:06,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:06,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:06,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:40:06,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1026658796, now seen corresponding path program 1 times [2022-12-06 05:40:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:06,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140136301] [2022-12-06 05:40:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140136301] [2022-12-06 05:40:06,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140136301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:06,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:06,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519949024] [2022-12-06 05:40:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:06,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:06,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 05:40:06,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:06,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:06,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 05:40:06,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:06,935 INFO L130 PetriNetUnfolder]: 130/263 cut-off events. [2022-12-06 05:40:06,935 INFO L131 PetriNetUnfolder]: For 616/627 co-relation queries the response was YES. [2022-12-06 05:40:06,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 263 events. 130/263 cut-off events. For 616/627 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1018 event pairs, 25 based on Foata normal form. 13/228 useless extension candidates. Maximal degree in co-relation 772. Up to 220 conditions per place. [2022-12-06 05:40:06,938 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 42 selfloop transitions, 5 changer transitions 3/51 dead transitions. [2022-12-06 05:40:06,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 443 flow [2022-12-06 05:40:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 05:40:06,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 05:40:06,940 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 257 flow. Second operand 4 states and 40 transitions. [2022-12-06 05:40:06,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 443 flow [2022-12-06 05:40:06,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 404 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 05:40:06,946 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 252 flow [2022-12-06 05:40:06,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2022-12-06 05:40:06,948 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 05:40:06,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:06,948 INFO L89 Accepts]: Start accepts. Operand has 39 places, 36 transitions, 252 flow [2022-12-06 05:40:06,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:06,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:06,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 36 transitions, 252 flow [2022-12-06 05:40:06,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 36 transitions, 252 flow [2022-12-06 05:40:06,960 INFO L130 PetriNetUnfolder]: 31/103 cut-off events. [2022-12-06 05:40:06,960 INFO L131 PetriNetUnfolder]: For 185/216 co-relation queries the response was YES. [2022-12-06 05:40:06,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 103 events. 31/103 cut-off events. For 185/216 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 382 event pairs, 0 based on Foata normal form. 12/96 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2022-12-06 05:40:06,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 36 transitions, 252 flow [2022-12-06 05:40:06,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 05:40:06,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, 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_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:07,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:07,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 05:40:07,070 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 257 flow [2022-12-06 05:40:07,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:07,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:07,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:07,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:40:07,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -908738390, now seen corresponding path program 2 times [2022-12-06 05:40:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291315534] [2022-12-06 05:40:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:07,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291315534] [2022-12-06 05:40:07,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291315534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:07,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:07,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540572450] [2022-12-06 05:40:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:07,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:07,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:07,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 05:40:07,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:07,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:07,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 05:40:07,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:07,575 INFO L130 PetriNetUnfolder]: 119/237 cut-off events. [2022-12-06 05:40:07,575 INFO L131 PetriNetUnfolder]: For 645/660 co-relation queries the response was YES. [2022-12-06 05:40:07,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 237 events. 119/237 cut-off events. For 645/660 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 851 event pairs, 26 based on Foata normal form. 19/222 useless extension candidates. Maximal degree in co-relation 745. Up to 174 conditions per place. [2022-12-06 05:40:07,577 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 37 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2022-12-06 05:40:07,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 363 flow [2022-12-06 05:40:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:40:07,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-06 05:40:07,579 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 257 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:40:07,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 363 flow [2022-12-06 05:40:07,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 342 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:07,582 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 234 flow [2022-12-06 05:40:07,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-06 05:40:07,583 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:40:07,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:07,583 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 234 flow [2022-12-06 05:40:07,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:07,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:07,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 234 flow [2022-12-06 05:40:07,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 234 flow [2022-12-06 05:40:07,595 INFO L130 PetriNetUnfolder]: 28/93 cut-off events. [2022-12-06 05:40:07,595 INFO L131 PetriNetUnfolder]: For 201/230 co-relation queries the response was YES. [2022-12-06 05:40:07,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 93 events. 28/93 cut-off events. For 201/230 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 328 event pairs, 0 based on Foata normal form. 10/85 useless extension candidates. Maximal degree in co-relation 174. Up to 28 conditions per place. [2022-12-06 05:40:07,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 234 flow [2022-12-06 05:40:07,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 05:40:07,613 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:07,613 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:07,613 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:07,615 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:07,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:07,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-06 05:40:07,910 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 252 flow [2022-12-06 05:40:07,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:07,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:07,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:07,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:40:07,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1081129842, now seen corresponding path program 1 times [2022-12-06 05:40:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:07,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223549147] [2022-12-06 05:40:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223549147] [2022-12-06 05:40:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223549147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:08,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:08,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045767804] [2022-12-06 05:40:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:08,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:40:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:40:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:40:08,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 05:40:08,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:08,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:08,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 05:40:08,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:08,399 INFO L130 PetriNetUnfolder]: 122/251 cut-off events. [2022-12-06 05:40:08,399 INFO L131 PetriNetUnfolder]: For 816/907 co-relation queries the response was YES. [2022-12-06 05:40:08,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 251 events. 122/251 cut-off events. For 816/907 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 952 event pairs, 27 based on Foata normal form. 15/225 useless extension candidates. Maximal degree in co-relation 637. Up to 223 conditions per place. [2022-12-06 05:40:08,401 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 33 selfloop transitions, 6 changer transitions 7/47 dead transitions. [2022-12-06 05:40:08,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 396 flow [2022-12-06 05:40:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:40:08,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 05:40:08,402 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 252 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:40:08,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 396 flow [2022-12-06 05:40:08,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 372 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:08,404 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 256 flow [2022-12-06 05:40:08,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2022-12-06 05:40:08,405 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 05:40:08,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:08,405 INFO L89 Accepts]: Start accepts. Operand has 39 places, 35 transitions, 256 flow [2022-12-06 05:40:08,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:08,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:08,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 35 transitions, 256 flow [2022-12-06 05:40:08,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 256 flow [2022-12-06 05:40:08,416 INFO L130 PetriNetUnfolder]: 28/102 cut-off events. [2022-12-06 05:40:08,416 INFO L131 PetriNetUnfolder]: For 193/218 co-relation queries the response was YES. [2022-12-06 05:40:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 102 events. 28/102 cut-off events. For 193/218 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 382 event pairs, 0 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 295. Up to 25 conditions per place. [2022-12-06 05:40:08,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 256 flow [2022-12-06 05:40:08,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 05:40:08,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_190| v_~q~0.base_138))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_171) v_~q~0.offset_138)) |v_thread2Thread1of1ForFork1_~j~0#1_55|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_228 4) v_~q~0.offset_138)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 1) (not (= (ite (and (<= 0 v_~q_back~0_228) (< v_~q_back~0_228 v_~n~0_151)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (ite (and (<= 0 v_~q_front~0_171) (< v_~q_front~0_171 v_~n~0_151) (< v_~q_front~0_171 v_~q_back~0_227)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q_back~0_228 1) v_~q_back~0_227) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_55| 0)) (= (+ 1 v_~q_front~0_171) v_~q_front~0_170) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_55| v_~s~0_114) v_~s~0_113) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ 1 v_~N~0_97)))) InVars {~q_back~0=v_~q_back~0_228, #memory_int=|v_#memory_int_190|, ~N~0=v_~N~0_97, ~q~0.base=v_~q~0.base_138, ~n~0=v_~n~0_151, ~q~0.offset=v_~q~0.offset_138, ~s~0=v_~s~0_114, ~q_front~0=v_~q_front~0_171} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_55|, ~q_back~0=v_~q_back~0_227, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_47|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_29|, ~N~0=v_~N~0_97, ~q~0.base=v_~q~0.base_138, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_47|, ~q~0.offset=v_~q~0.offset_138, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_33|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_29|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, #memory_int=|v_#memory_int_190|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_151, ~s~0=v_~s~0_113, ~q_front~0=v_~q_front~0_170} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:08,423 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:08,424 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:08,424 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:08,424 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:08,424 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:08,424 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:08,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:08,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 05:40:08,667 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 252 flow [2022-12-06 05:40:08,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:08,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:08,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:08,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:40:08,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash 608260745, now seen corresponding path program 1 times [2022-12-06 05:40:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:08,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401488580] [2022-12-06 05:40:08,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:08,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401488580] [2022-12-06 05:40:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401488580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:08,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065342092] [2022-12-06 05:40:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:08,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:40:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:09,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 05:40:09,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:09,140 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 05:40:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:09,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:09,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:09,212 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 42 treesize of output 30 [2022-12-06 05:40:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065342092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:09,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:09,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:40:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95391242] [2022-12-06 05:40:09,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:09,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:40:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:40:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:40:09,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 05:40:09,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 252 flow. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:09,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:09,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 05:40:09,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:09,582 INFO L130 PetriNetUnfolder]: 170/332 cut-off events. [2022-12-06 05:40:09,583 INFO L131 PetriNetUnfolder]: For 897/966 co-relation queries the response was YES. [2022-12-06 05:40:09,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 332 events. 170/332 cut-off events. For 897/966 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1392 event pairs, 11 based on Foata normal form. 28/304 useless extension candidates. Maximal degree in co-relation 1218. Up to 225 conditions per place. [2022-12-06 05:40:09,585 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 52 selfloop transitions, 21 changer transitions 2/76 dead transitions. [2022-12-06 05:40:09,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 615 flow [2022-12-06 05:40:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:40:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:40:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 05:40:09,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2022-12-06 05:40:09,586 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 252 flow. Second operand 7 states and 64 transitions. [2022-12-06 05:40:09,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 615 flow [2022-12-06 05:40:09,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 587 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:09,589 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 416 flow [2022-12-06 05:40:09,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2022-12-06 05:40:09,589 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 05:40:09,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:09,589 INFO L89 Accepts]: Start accepts. Operand has 43 places, 47 transitions, 416 flow [2022-12-06 05:40:09,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:09,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:09,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 47 transitions, 416 flow [2022-12-06 05:40:09,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 47 transitions, 416 flow [2022-12-06 05:40:09,601 INFO L130 PetriNetUnfolder]: 41/136 cut-off events. [2022-12-06 05:40:09,601 INFO L131 PetriNetUnfolder]: For 468/525 co-relation queries the response was YES. [2022-12-06 05:40:09,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 136 events. 41/136 cut-off events. For 468/525 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 591 event pairs, 0 based on Foata normal form. 7/117 useless extension candidates. Maximal degree in co-relation 441. Up to 43 conditions per place. [2022-12-06 05:40:09,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 47 transitions, 416 flow [2022-12-06 05:40:09,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 05:40:09,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_234| v_~q~0.base_164)) (.cse2 (* v_~q_back~0_281 4))) (and (= v_~q_back~0_279 (+ 2 v_~q_back~0_281)) (= |v_thread1Thread1of1ForFork0_~i~0#1_98| 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_98| (+ v_~N~0_119 1)) (not (= (ite (let ((.cse0 (+ v_~q_back~0_281 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_177))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_281) (< v_~q_back~0_281 v_~n~0_177)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_24| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread1Thread1of1ForFork0_#res#1.base_24| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_98| v_~N~0_119)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_164)) 1) 1 0) 0)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_164 4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)))) InVars {~q_back~0=v_~q_back~0_281, #memory_int=|v_#memory_int_234|, ~N~0=v_~N~0_119, ~q~0.base=v_~q~0.base_164, ~n~0=v_~n~0_177, ~q~0.offset=v_~q~0.offset_164} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_24|, ~q_back~0=v_~q_back~0_279, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_42|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_44|, ~N~0=v_~N~0_119, ~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_83|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_48|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_44|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_98|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_42|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_234|, ~n~0=v_~n~0_177, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_24|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:40:09,750 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:09,751 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:09,840 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:09,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 05:40:09,841 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 46 transitions, 418 flow [2022-12-06 05:40:09,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:09,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:09,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:09,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:10,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1268985193, now seen corresponding path program 1 times [2022-12-06 05:40:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:10,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813893790] [2022-12-06 05:40:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:10,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813893790] [2022-12-06 05:40:10,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813893790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:10,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:10,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:10,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793807673] [2022-12-06 05:40:10,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:10,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:10,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 05:40:10,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:10,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:10,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 05:40:10,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:10,219 INFO L130 PetriNetUnfolder]: 155/314 cut-off events. [2022-12-06 05:40:10,219 INFO L131 PetriNetUnfolder]: For 1395/1429 co-relation queries the response was YES. [2022-12-06 05:40:10,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 314 events. 155/314 cut-off events. For 1395/1429 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1267 event pairs, 37 based on Foata normal form. 6/271 useless extension candidates. Maximal degree in co-relation 1334. Up to 219 conditions per place. [2022-12-06 05:40:10,221 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 43 selfloop transitions, 7 changer transitions 5/56 dead transitions. [2022-12-06 05:40:10,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 561 flow [2022-12-06 05:40:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 05:40:10,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 05:40:10,222 INFO L175 Difference]: Start difference. First operand has 42 places, 46 transitions, 418 flow. Second operand 5 states and 45 transitions. [2022-12-06 05:40:10,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 561 flow [2022-12-06 05:40:10,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 525 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:10,226 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 369 flow [2022-12-06 05:40:10,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-06 05:40:10,227 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 05:40:10,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:10,228 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 369 flow [2022-12-06 05:40:10,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:10,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:10,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 369 flow [2022-12-06 05:40:10,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 369 flow [2022-12-06 05:40:10,238 INFO L130 PetriNetUnfolder]: 36/124 cut-off events. [2022-12-06 05:40:10,238 INFO L131 PetriNetUnfolder]: For 373/412 co-relation queries the response was YES. [2022-12-06 05:40:10,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 124 events. 36/124 cut-off events. For 373/412 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 501 event pairs, 0 based on Foata normal form. 7/107 useless extension candidates. Maximal degree in co-relation 370. Up to 34 conditions per place. [2022-12-06 05:40:10,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 43 transitions, 369 flow [2022-12-06 05:40:10,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 05:40:10,239 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:10,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:40:10,241 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 369 flow [2022-12-06 05:40:10,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:10,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:10,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:40:10,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash -787977895, now seen corresponding path program 1 times [2022-12-06 05:40:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:10,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465529702] [2022-12-06 05:40:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465529702] [2022-12-06 05:40:10,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465529702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848536302] [2022-12-06 05:40:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:10,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:10,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:10,571 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 05:40:10,625 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 05:40:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:10,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:40:10,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:10,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:10,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:40:10,764 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 23 treesize of output 7 [2022-12-06 05:40:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:10,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:10,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:10,832 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 86 treesize of output 74 [2022-12-06 05:40:10,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:40:10,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:40:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:10,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848536302] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:10,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:10,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:40:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449474520] [2022-12-06 05:40:10,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:40:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:40:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:40:10,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 05:40:10,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 369 flow. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:10,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:10,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 05:40:10,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:11,072 INFO L130 PetriNetUnfolder]: 158/319 cut-off events. [2022-12-06 05:40:11,072 INFO L131 PetriNetUnfolder]: For 1322/1420 co-relation queries the response was YES. [2022-12-06 05:40:11,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 319 events. 158/319 cut-off events. For 1322/1420 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1317 event pairs, 39 based on Foata normal form. 26/296 useless extension candidates. Maximal degree in co-relation 1261. Up to 277 conditions per place. [2022-12-06 05:40:11,074 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 45 selfloop transitions, 10 changer transitions 2/58 dead transitions. [2022-12-06 05:40:11,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 549 flow [2022-12-06 05:40:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:40:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:40:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 05:40:11,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:40:11,075 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 369 flow. Second operand 6 states and 44 transitions. [2022-12-06 05:40:11,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 549 flow [2022-12-06 05:40:11,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 521 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:11,079 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 397 flow [2022-12-06 05:40:11,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 05:40:11,079 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 05:40:11,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:11,079 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 397 flow [2022-12-06 05:40:11,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:11,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:11,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 397 flow [2022-12-06 05:40:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 397 flow [2022-12-06 05:40:11,091 INFO L130 PetriNetUnfolder]: 36/127 cut-off events. [2022-12-06 05:40:11,092 INFO L131 PetriNetUnfolder]: For 396/437 co-relation queries the response was YES. [2022-12-06 05:40:11,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 127 events. 36/127 cut-off events. For 396/437 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 551 event pairs, 0 based on Foata normal form. 8/112 useless extension candidates. Maximal degree in co-relation 394. Up to 35 conditions per place. [2022-12-06 05:40:11,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 397 flow [2022-12-06 05:40:11,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 05:40:11,099 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:11,100 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:11,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:11,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 05:40:11,187 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 391 flow [2022-12-06 05:40:11,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:11,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:11,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:11,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:11,388 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,SelfDestructingSolverStorable10 [2022-12-06 05:40:11,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash 463792091, now seen corresponding path program 1 times [2022-12-06 05:40:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:11,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771435168] [2022-12-06 05:40:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771435168] [2022-12-06 05:40:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771435168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578755922] [2022-12-06 05:40:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:11,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:11,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:11,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:11,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:40:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:11,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:40:11,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:11,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:40:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578755922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:40:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:40:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642612609] [2022-12-06 05:40:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:11,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:11,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 05:40:11,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:11,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:11,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 05:40:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:11,690 INFO L130 PetriNetUnfolder]: 181/370 cut-off events. [2022-12-06 05:40:11,690 INFO L131 PetriNetUnfolder]: For 1512/1548 co-relation queries the response was YES. [2022-12-06 05:40:11,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 370 events. 181/370 cut-off events. For 1512/1548 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1578 event pairs, 75 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 1496. Up to 193 conditions per place. [2022-12-06 05:40:11,693 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 56 selfloop transitions, 1 changer transitions 7/65 dead transitions. [2022-12-06 05:40:11,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 634 flow [2022-12-06 05:40:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:40:11,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 05:40:11,693 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 391 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:40:11,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 634 flow [2022-12-06 05:40:11,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 604 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:11,697 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 313 flow [2022-12-06 05:40:11,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-06 05:40:11,697 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 05:40:11,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:11,698 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 313 flow [2022-12-06 05:40:11,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:11,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:11,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 313 flow [2022-12-06 05:40:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 313 flow [2022-12-06 05:40:11,711 INFO L130 PetriNetUnfolder]: 42/138 cut-off events. [2022-12-06 05:40:11,711 INFO L131 PetriNetUnfolder]: For 274/295 co-relation queries the response was YES. [2022-12-06 05:40:11,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 138 events. 42/138 cut-off events. For 274/295 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 567 event pairs, 0 based on Foata normal form. 7/115 useless extension candidates. Maximal degree in co-relation 463. Up to 39 conditions per place. [2022-12-06 05:40:11,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 313 flow [2022-12-06 05:40:11,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 05:40:11,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [562] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_232| v_~q~0.base_162)) (.cse2 (* v_~q_back~0_275 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_79| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_79|) (not (= (ite (let ((.cse0 (+ v_~q_back~0_275 1))) (and (< .cse0 v_~n~0_175) (<= 0 .cse0))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_94| (+ v_~N~0_117 1)) (not (= 0 (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_162)) 1) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_94| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_79| 0)) (not (= (ite (and (<= 0 v_~q_back~0_275) (< v_~q_back~0_275 v_~n~0_175)) 1 0) 0)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_162 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_79|) (= (+ 2 v_~q_back~0_275) v_~q_back~0_273))) InVars {~q_back~0=v_~q_back~0_275, #memory_int=|v_#memory_int_232|, ~N~0=v_~N~0_117, ~q~0.base=v_~q~0.base_162, ~n~0=v_~n~0_175, ~q~0.offset=v_~q~0.offset_162} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_79|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_44|, ~q_back~0=v_~q_back~0_273, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_40|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_79|, #memory_int=|v_#memory_int_232|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_40|, ~N~0=v_~N~0_117, ~q~0.base=v_~q~0.base_162, ~n~0=v_~n~0_175, ~q~0.offset=v_~q~0.offset_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:11,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:11,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 05:40:11,858 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 319 flow [2022-12-06 05:40:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:11,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:11,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:11,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:12,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:12,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1382060673, now seen corresponding path program 1 times [2022-12-06 05:40:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:12,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558008301] [2022-12-06 05:40:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558008301] [2022-12-06 05:40:12,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558008301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:12,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:12,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669834695] [2022-12-06 05:40:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:12,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:12,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 05:40:12,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:12,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:12,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 05:40:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:12,602 INFO L130 PetriNetUnfolder]: 210/413 cut-off events. [2022-12-06 05:40:12,602 INFO L131 PetriNetUnfolder]: For 1331/1366 co-relation queries the response was YES. [2022-12-06 05:40:12,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 413 events. 210/413 cut-off events. For 1331/1366 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1760 event pairs, 24 based on Foata normal form. 37/378 useless extension candidates. Maximal degree in co-relation 1819. Up to 316 conditions per place. [2022-12-06 05:40:12,604 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 48 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2022-12-06 05:40:12,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 579 flow [2022-12-06 05:40:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:40:12,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:40:12,605 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 319 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:40:12,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 579 flow [2022-12-06 05:40:12,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 560 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:12,608 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 419 flow [2022-12-06 05:40:12,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2022-12-06 05:40:12,610 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 05:40:12,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:12,611 INFO L89 Accepts]: Start accepts. Operand has 45 places, 47 transitions, 419 flow [2022-12-06 05:40:12,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:12,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:12,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 419 flow [2022-12-06 05:40:12,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 419 flow [2022-12-06 05:40:12,627 INFO L130 PetriNetUnfolder]: 60/180 cut-off events. [2022-12-06 05:40:12,627 INFO L131 PetriNetUnfolder]: For 545/579 co-relation queries the response was YES. [2022-12-06 05:40:12,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 180 events. 60/180 cut-off events. For 545/579 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 791 event pairs, 0 based on Foata normal form. 14/158 useless extension candidates. Maximal degree in co-relation 439. Up to 56 conditions per place. [2022-12-06 05:40:12,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 419 flow [2022-12-06 05:40:12,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 05:40:15,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:15,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2407 [2022-12-06 05:40:15,017 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 435 flow [2022-12-06 05:40:15,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:15,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:15,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:15,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:40:15,018 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1840847627, now seen corresponding path program 1 times [2022-12-06 05:40:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:15,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801535520] [2022-12-06 05:40:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:15,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:15,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801535520] [2022-12-06 05:40:15,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801535520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:15,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621353493] [2022-12-06 05:40:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:15,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:15,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:15,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:15,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:40:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:15,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 05:40:15,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:15,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:15,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:40:15,697 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 05:40:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:15,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:15,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:15,935 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 86 treesize of output 74 [2022-12-06 05:40:15,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:40:15,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:40:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621353493] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:16,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:16,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:40:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952169035] [2022-12-06 05:40:16,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:16,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:40:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:40:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=190, Unknown=3, NotChecked=0, Total=240 [2022-12-06 05:40:16,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 05:40:16,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 435 flow. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:16,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:16,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 05:40:16,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:16,870 INFO L130 PetriNetUnfolder]: 310/609 cut-off events. [2022-12-06 05:40:16,870 INFO L131 PetriNetUnfolder]: For 2287/2344 co-relation queries the response was YES. [2022-12-06 05:40:16,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 609 events. 310/609 cut-off events. For 2287/2344 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2857 event pairs, 28 based on Foata normal form. 50/567 useless extension candidates. Maximal degree in co-relation 1736. Up to 395 conditions per place. [2022-12-06 05:40:16,873 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 64 selfloop transitions, 53 changer transitions 21/139 dead transitions. [2022-12-06 05:40:16,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 139 transitions, 1334 flow [2022-12-06 05:40:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:40:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:40:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-12-06 05:40:16,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3062200956937799 [2022-12-06 05:40:16,875 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 435 flow. Second operand 19 states and 128 transitions. [2022-12-06 05:40:16,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 139 transitions, 1334 flow [2022-12-06 05:40:16,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 139 transitions, 1301 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:40:16,883 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 972 flow [2022-12-06 05:40:16,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=972, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2022-12-06 05:40:16,884 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-06 05:40:16,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:16,884 INFO L89 Accepts]: Start accepts. Operand has 70 places, 84 transitions, 972 flow [2022-12-06 05:40:16,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:16,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:16,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 84 transitions, 972 flow [2022-12-06 05:40:16,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 84 transitions, 972 flow [2022-12-06 05:40:16,903 INFO L130 PetriNetUnfolder]: 74/232 cut-off events. [2022-12-06 05:40:16,904 INFO L131 PetriNetUnfolder]: For 1094/1148 co-relation queries the response was YES. [2022-12-06 05:40:16,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 232 events. 74/232 cut-off events. For 1094/1148 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1122 event pairs, 0 based on Foata normal form. 14/219 useless extension candidates. Maximal degree in co-relation 969. Up to 89 conditions per place. [2022-12-06 05:40:16,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 84 transitions, 972 flow [2022-12-06 05:40:16,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 05:40:16,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, 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_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:17,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, 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_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:40:17,112 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,112 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,112 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,112 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L93-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|) (= (store |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71| (store (select |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) |v_ULTIMATE.start_main_~#t2~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre14#1_77|)) |v_#memory_int_267|) (= |v_ULTIMATE.start_main_#t~pre14#1_77| |v_#pthreadsForks_89|) (not (= (ite (and (<= 0 v_~q_back~0_317) (< v_~q_back~0_317 v_~n~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| (ite (= (select (select |v_#memory_int_268| v_~q~0.base_184) (+ (* v_~q_back~0_317 4) v_~q~0.offset_184)) 1) 1 0)) (= |v_#pthreadsForks_88| (+ |v_#pthreadsForks_89| 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_116| 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_116| (+ v_~N~0_133 1)) (= (+ v_~q_back~0_317 1) v_~q_back~0_316) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_89|, ~q_back~0=v_~q_back~0_317, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, #memory_int=|v_#memory_int_268|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~n~0=v_~n~0_195, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} OutVars{~q_back~0=v_~q_back~0_316, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_62|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_77|, #pthreadsForks=|v_#pthreadsForks_88|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_66|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_62|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_267|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_66|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~n~0=v_~n~0_195, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:40:17,554 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L93-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|) (= (store |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71| (store (select |v_#memory_int_268| |v_ULTIMATE.start_main_~#t2~0#1.base_71|) |v_ULTIMATE.start_main_~#t2~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre14#1_77|)) |v_#memory_int_267|) (= |v_ULTIMATE.start_main_#t~pre14#1_77| |v_#pthreadsForks_89|) (not (= (ite (and (<= 0 v_~q_back~0_317) (< v_~q_back~0_317 v_~n~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| (ite (= (select (select |v_#memory_int_268| v_~q~0.base_184) (+ (* v_~q_back~0_317 4) v_~q~0.offset_184)) 1) 1 0)) (= |v_#pthreadsForks_88| (+ |v_#pthreadsForks_89| 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_116| 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_116| (+ v_~N~0_133 1)) (= (+ v_~q_back~0_317 1) v_~q_back~0_316) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_89|, ~q_back~0=v_~q_back~0_317, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, #memory_int=|v_#memory_int_268|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~n~0=v_~n~0_195, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} OutVars{~q_back~0=v_~q_back~0_316, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_69|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_62|, ~N~0=v_~N~0_133, ~q~0.base=v_~q~0.base_184, ~q~0.offset=v_~q~0.offset_184, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_77|, #pthreadsForks=|v_#pthreadsForks_88|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_66|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_62|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_267|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_66|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~n~0=v_~n~0_195, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_71|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:17,555 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,555 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,555 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,555 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:17,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:17,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:17,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:18,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:18,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_265| v_~q~0.base_182))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (= (ite (and (<= 0 v_~q_front~0_220) (< v_~q_front~0_220 v_~n~0_193) (< v_~q_front~0_220 v_~q_back~0_312)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_81| v_~s~0_154) v_~s~0_153) (< |v_thread1Thread1of1ForFork0_~i~0#1_114| (+ v_~N~0_131 1)) (= (select .cse0 (+ (* 4 v_~q_front~0_220) v_~q~0.offset_182)) |v_thread2Thread1of1ForFork1_~j~0#1_81|) (= (+ v_~q_back~0_313 1) v_~q_back~0_312) (= |v_thread1Thread1of1ForFork0_~i~0#1_114| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|) (not (= (ite (and (<= 0 v_~q_back~0_313) (< v_~q_back~0_313 v_~n~0_193)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_81| 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_313 4) v_~q~0.offset_182)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= (+ 1 v_~q_front~0_220) v_~q_front~0_219))) InVars {~q_back~0=v_~q_back~0_313, #memory_int=|v_#memory_int_265|, ~N~0=v_~N~0_131, ~q~0.base=v_~q~0.base_182, ~n~0=v_~n~0_193, ~q~0.offset=v_~q~0.offset_182, ~s~0=v_~s~0_154, ~q_front~0=v_~q_front~0_220} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_81|, ~q_back~0=v_~q_back~0_312, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_70|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_70|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_60|, ~N~0=v_~N~0_131, ~q~0.base=v_~q~0.base_182, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_70|, ~q~0.offset=v_~q~0.offset_182, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_64|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_60|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, #memory_int=|v_#memory_int_265|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, ~n~0=v_~n~0_193, ~s~0=v_~s~0_153, ~q_front~0=v_~q_front~0_219} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:18,278 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:18,278 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:18,278 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:18,278 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:18,278 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:18,278 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:18,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:18,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:18,786 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:40:18,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1906 [2022-12-06 05:40:18,790 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 1008 flow [2022-12-06 05:40:18,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:18,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:18,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:18,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:18,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:18,995 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 238360239, now seen corresponding path program 1 times [2022-12-06 05:40:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:18,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555338718] [2022-12-06 05:40:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:19,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555338718] [2022-12-06 05:40:19,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555338718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:19,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:19,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827283529] [2022-12-06 05:40:19,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:19,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:19,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:40:19,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 1008 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:19,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:19,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:40:19,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:19,520 INFO L130 PetriNetUnfolder]: 333/640 cut-off events. [2022-12-06 05:40:19,521 INFO L131 PetriNetUnfolder]: For 4429/4494 co-relation queries the response was YES. [2022-12-06 05:40:19,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3658 conditions, 640 events. 333/640 cut-off events. For 4429/4494 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 47 based on Foata normal form. 38/606 useless extension candidates. Maximal degree in co-relation 3289. Up to 366 conditions per place. [2022-12-06 05:40:19,525 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 78 selfloop transitions, 38 changer transitions 0/117 dead transitions. [2022-12-06 05:40:19,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 1542 flow [2022-12-06 05:40:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 05:40:19,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2022-12-06 05:40:19,526 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 1008 flow. Second operand 5 states and 68 transitions. [2022-12-06 05:40:19,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 1542 flow [2022-12-06 05:40:19,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 117 transitions, 1234 flow, removed 151 selfloop flow, removed 7 redundant places. [2022-12-06 05:40:19,533 INFO L231 Difference]: Finished difference. Result has 62 places, 90 transitions, 1025 flow [2022-12-06 05:40:19,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1025, PETRI_PLACES=62, PETRI_TRANSITIONS=90} [2022-12-06 05:40:19,533 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 41 predicate places. [2022-12-06 05:40:19,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:19,534 INFO L89 Accepts]: Start accepts. Operand has 62 places, 90 transitions, 1025 flow [2022-12-06 05:40:19,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:19,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:19,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 90 transitions, 1025 flow [2022-12-06 05:40:19,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 90 transitions, 1025 flow [2022-12-06 05:40:19,555 INFO L130 PetriNetUnfolder]: 87/273 cut-off events. [2022-12-06 05:40:19,555 INFO L131 PetriNetUnfolder]: For 1527/1600 co-relation queries the response was YES. [2022-12-06 05:40:19,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 273 events. 87/273 cut-off events. For 1527/1600 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1445 event pairs, 3 based on Foata normal form. 16/277 useless extension candidates. Maximal degree in co-relation 1170. Up to 116 conditions per place. [2022-12-06 05:40:19,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 90 transitions, 1025 flow [2022-12-06 05:40:19,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:40:19,557 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:19,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 05:40:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 90 transitions, 1025 flow [2022-12-06 05:40:19,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:19,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:19,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:19,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:40:19,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1510971701, now seen corresponding path program 1 times [2022-12-06 05:40:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976129239] [2022-12-06 05:40:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:19,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976129239] [2022-12-06 05:40:19,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976129239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:19,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725230383] [2022-12-06 05:40:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:19,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:19,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:19,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:19,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:40:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:19,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:40:19,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:19,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:19,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:40:19,994 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 05:40:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:20,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:20,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:20,062 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 86 treesize of output 74 [2022-12-06 05:40:20,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:40:20,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:40:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:20,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725230383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:20,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:20,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:40:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549406060] [2022-12-06 05:40:20,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:20,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:40:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:40:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:40:20,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:40:20,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 90 transitions, 1025 flow. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:20,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:20,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:40:20,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:20,336 INFO L130 PetriNetUnfolder]: 345/675 cut-off events. [2022-12-06 05:40:20,336 INFO L131 PetriNetUnfolder]: For 5373/5421 co-relation queries the response was YES. [2022-12-06 05:40:20,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 675 events. 345/675 cut-off events. For 5373/5421 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3360 event pairs, 79 based on Foata normal form. 23/685 useless extension candidates. Maximal degree in co-relation 3503. Up to 617 conditions per place. [2022-12-06 05:40:20,340 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 87 selfloop transitions, 17 changer transitions 2/107 dead transitions. [2022-12-06 05:40:20,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 1347 flow [2022-12-06 05:40:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:40:20,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:40:20,342 INFO L175 Difference]: Start difference. First operand has 62 places, 90 transitions, 1025 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:40:20,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 1347 flow [2022-12-06 05:40:20,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 107 transitions, 1317 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-06 05:40:20,352 INFO L231 Difference]: Finished difference. Result has 67 places, 94 transitions, 1105 flow [2022-12-06 05:40:20,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1105, PETRI_PLACES=67, PETRI_TRANSITIONS=94} [2022-12-06 05:40:20,353 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-06 05:40:20,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:20,353 INFO L89 Accepts]: Start accepts. Operand has 67 places, 94 transitions, 1105 flow [2022-12-06 05:40:20,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:20,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:20,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 94 transitions, 1105 flow [2022-12-06 05:40:20,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 94 transitions, 1105 flow [2022-12-06 05:40:20,376 INFO L130 PetriNetUnfolder]: 86/285 cut-off events. [2022-12-06 05:40:20,376 INFO L131 PetriNetUnfolder]: For 1794/1879 co-relation queries the response was YES. [2022-12-06 05:40:20,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 285 events. 86/285 cut-off events. For 1794/1879 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1611 event pairs, 1 based on Foata normal form. 17/292 useless extension candidates. Maximal degree in co-relation 1216. Up to 118 conditions per place. [2022-12-06 05:40:20,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 94 transitions, 1105 flow [2022-12-06 05:40:20,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 05:40:20,383 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:20,383 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:20,462 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:20,462 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:20,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:20,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:40:20,537 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 93 transitions, 1098 flow [2022-12-06 05:40:20,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:20,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:20,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:20,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:40:20,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:40:20,738 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash -814112697, now seen corresponding path program 1 times [2022-12-06 05:40:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:20,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307871618] [2022-12-06 05:40:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307871618] [2022-12-06 05:40:20,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307871618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:20,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:20,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169081670] [2022-12-06 05:40:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:20,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:20,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:20,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:20,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:40:20,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 93 transitions, 1098 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:20,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:20,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:40:20,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:21,173 INFO L130 PetriNetUnfolder]: 338/662 cut-off events. [2022-12-06 05:40:21,174 INFO L131 PetriNetUnfolder]: For 5623/5651 co-relation queries the response was YES. [2022-12-06 05:40:21,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 662 events. 338/662 cut-off events. For 5623/5651 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3177 event pairs, 51 based on Foata normal form. 5/658 useless extension candidates. Maximal degree in co-relation 3479. Up to 487 conditions per place. [2022-12-06 05:40:21,181 INFO L137 encePairwiseOnDemand]: 16/35 looper letters, 77 selfloop transitions, 24 changer transitions 2/104 dead transitions. [2022-12-06 05:40:21,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 1356 flow [2022-12-06 05:40:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:40:21,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 05:40:21,182 INFO L175 Difference]: Start difference. First operand has 66 places, 93 transitions, 1098 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:40:21,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 1356 flow [2022-12-06 05:40:21,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 1295 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:21,192 INFO L231 Difference]: Finished difference. Result has 68 places, 92 transitions, 1084 flow [2022-12-06 05:40:21,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1084, PETRI_PLACES=68, PETRI_TRANSITIONS=92} [2022-12-06 05:40:21,193 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-06 05:40:21,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:21,193 INFO L89 Accepts]: Start accepts. Operand has 68 places, 92 transitions, 1084 flow [2022-12-06 05:40:21,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:21,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:21,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 92 transitions, 1084 flow [2022-12-06 05:40:21,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 92 transitions, 1084 flow [2022-12-06 05:40:21,215 INFO L130 PetriNetUnfolder]: 85/279 cut-off events. [2022-12-06 05:40:21,216 INFO L131 PetriNetUnfolder]: For 1837/1934 co-relation queries the response was YES. [2022-12-06 05:40:21,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 279 events. 85/279 cut-off events. For 1837/1934 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1541 event pairs, 1 based on Foata normal form. 17/286 useless extension candidates. Maximal degree in co-relation 1157. Up to 115 conditions per place. [2022-12-06 05:40:21,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 92 transitions, 1084 flow [2022-12-06 05:40:21,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 05:40:21,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:21,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 05:40:21,219 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 92 transitions, 1084 flow [2022-12-06 05:40:21,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:21,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:21,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:21,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:40:21,219 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1514218920, now seen corresponding path program 1 times [2022-12-06 05:40:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:21,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832793371] [2022-12-06 05:40:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832793371] [2022-12-06 05:40:21,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832793371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835411356] [2022-12-06 05:40:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:21,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:21,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:40:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:21,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:40:21,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:21,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:40:21,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835411356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:21,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:40:21,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 05:40:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502002464] [2022-12-06 05:40:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:21,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:40:21,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 92 transitions, 1084 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:21,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:21,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:40:21,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:21,479 INFO L130 PetriNetUnfolder]: 364/719 cut-off events. [2022-12-06 05:40:21,479 INFO L131 PetriNetUnfolder]: For 6493/6565 co-relation queries the response was YES. [2022-12-06 05:40:21,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 719 events. 364/719 cut-off events. For 6493/6565 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3655 event pairs, 45 based on Foata normal form. 21/730 useless extension candidates. Maximal degree in co-relation 4078. Up to 527 conditions per place. [2022-12-06 05:40:21,484 INFO L137 encePairwiseOnDemand]: 16/34 looper letters, 78 selfloop transitions, 33 changer transitions 5/117 dead transitions. [2022-12-06 05:40:21,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1533 flow [2022-12-06 05:40:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 05:40:21,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40441176470588236 [2022-12-06 05:40:21,485 INFO L175 Difference]: Start difference. First operand has 67 places, 92 transitions, 1084 flow. Second operand 4 states and 55 transitions. [2022-12-06 05:40:21,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1533 flow [2022-12-06 05:40:21,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 1495 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:21,497 INFO L231 Difference]: Finished difference. Result has 69 places, 94 transitions, 1179 flow [2022-12-06 05:40:21,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1179, PETRI_PLACES=69, PETRI_TRANSITIONS=94} [2022-12-06 05:40:21,498 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2022-12-06 05:40:21,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:21,498 INFO L89 Accepts]: Start accepts. Operand has 69 places, 94 transitions, 1179 flow [2022-12-06 05:40:21,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:21,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:21,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 94 transitions, 1179 flow [2022-12-06 05:40:21,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 94 transitions, 1179 flow [2022-12-06 05:40:21,523 INFO L130 PetriNetUnfolder]: 88/294 cut-off events. [2022-12-06 05:40:21,523 INFO L131 PetriNetUnfolder]: For 2143/2235 co-relation queries the response was YES. [2022-12-06 05:40:21,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 294 events. 88/294 cut-off events. For 2143/2235 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1673 event pairs, 2 based on Foata normal form. 16/297 useless extension candidates. Maximal degree in co-relation 1424. Up to 123 conditions per place. [2022-12-06 05:40:21,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 94 transitions, 1179 flow [2022-12-06 05:40:21,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 05:40:21,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_273| v_~q~0.base_188))) (and (not (= (ite (and (<= 0 v_~q_back~0_328) (< v_~q_back~0_328 v_~n~0_199)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_34| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_122| v_~N~0_137)) (< |v_thread1Thread1of1ForFork0_~i~0#1_122| (+ v_~N~0_137 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_122| 1) (= (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_188 (* v_~q_back~0_326 4))) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_188 (* v_~q_back~0_328 4))) 1) 1 0) 0)) (= v_~q_back~0_326 (+ 2 v_~q_back~0_328)) (not (= (ite (and (<= 1 v_~q_back~0_326) (< v_~q_back~0_326 (+ v_~n~0_199 1))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_328, #memory_int=|v_#memory_int_273|, ~N~0=v_~N~0_137, ~q~0.base=v_~q~0.base_188, ~n~0=v_~n~0_199, ~q~0.offset=v_~q~0.offset_188} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_34|, ~q_back~0=v_~q_back~0_326, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_52|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_68|, ~N~0=v_~N~0_137, ~q~0.base=v_~q~0.base_188, ~q~0.offset=v_~q~0.offset_188, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_72|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_68|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_122|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_199, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_34|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:40:21,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:21,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 05:40:21,648 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 93 transitions, 1175 flow [2022-12-06 05:40:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:21,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:21,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:21,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:21,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 05:40:21,849 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -826583320, now seen corresponding path program 1 times [2022-12-06 05:40:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:21,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519804258] [2022-12-06 05:40:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:22,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519804258] [2022-12-06 05:40:22,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519804258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:22,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351198240] [2022-12-06 05:40:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:22,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:22,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:22,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:40:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:22,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:40:22,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:22,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:22,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:40:22,478 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 05:40:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:22,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:22,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:22,550 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 82 treesize of output 70 [2022-12-06 05:40:22,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 47 [2022-12-06 05:40:22,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 41 [2022-12-06 05:40:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:22,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351198240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:22,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:22,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-12-06 05:40:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779053493] [2022-12-06 05:40:22,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:22,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:40:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:40:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:40:22,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:40:22,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 93 transitions, 1175 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:22,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:22,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:40:22,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:22,893 INFO L130 PetriNetUnfolder]: 361/705 cut-off events. [2022-12-06 05:40:22,893 INFO L131 PetriNetUnfolder]: For 6914/7002 co-relation queries the response was YES. [2022-12-06 05:40:22,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 705 events. 361/705 cut-off events. For 6914/7002 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3512 event pairs, 63 based on Foata normal form. 33/728 useless extension candidates. Maximal degree in co-relation 4279. Up to 646 conditions per place. [2022-12-06 05:40:22,899 INFO L137 encePairwiseOnDemand]: 15/31 looper letters, 90 selfloop transitions, 21 changer transitions 2/114 dead transitions. [2022-12-06 05:40:22,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 1551 flow [2022-12-06 05:40:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:40:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:40:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-06 05:40:22,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2764976958525346 [2022-12-06 05:40:22,900 INFO L175 Difference]: Start difference. First operand has 68 places, 93 transitions, 1175 flow. Second operand 7 states and 60 transitions. [2022-12-06 05:40:22,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 1551 flow [2022-12-06 05:40:22,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 1479 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:22,911 INFO L231 Difference]: Finished difference. Result has 72 places, 97 transitions, 1246 flow [2022-12-06 05:40:22,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1246, PETRI_PLACES=72, PETRI_TRANSITIONS=97} [2022-12-06 05:40:22,912 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-06 05:40:22,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:22,912 INFO L89 Accepts]: Start accepts. Operand has 72 places, 97 transitions, 1246 flow [2022-12-06 05:40:22,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:22,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:22,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 97 transitions, 1246 flow [2022-12-06 05:40:22,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 97 transitions, 1246 flow [2022-12-06 05:40:22,937 INFO L130 PetriNetUnfolder]: 88/293 cut-off events. [2022-12-06 05:40:22,938 INFO L131 PetriNetUnfolder]: For 2153/2246 co-relation queries the response was YES. [2022-12-06 05:40:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 293 events. 88/293 cut-off events. For 2153/2246 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1681 event pairs, 2 based on Foata normal form. 19/304 useless extension candidates. Maximal degree in co-relation 1416. Up to 124 conditions per place. [2022-12-06 05:40:22,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 97 transitions, 1246 flow [2022-12-06 05:40:22,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 05:40:22,948 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:22,948 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:23,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:23,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 05:40:23,046 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 96 transitions, 1232 flow [2022-12-06 05:40:23,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:23,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:23,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:23,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:23,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:23,253 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -575027323, now seen corresponding path program 1 times [2022-12-06 05:40:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:23,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842094908] [2022-12-06 05:40:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:23,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:23,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842094908] [2022-12-06 05:40:23,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842094908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:23,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687128490] [2022-12-06 05:40:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:23,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:23,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:23,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:23,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:40:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:23,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:40:23,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:23,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:23,715 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:40:23,715 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 27 treesize of output 16 [2022-12-06 05:40:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:23,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687128490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:23,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:23,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:40:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961916166] [2022-12-06 05:40:23,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:23,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:40:23,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:23,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:40:23,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:40:23,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 05:40:23,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 96 transitions, 1232 flow. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:23,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:23,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 05:40:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:24,176 INFO L130 PetriNetUnfolder]: 449/872 cut-off events. [2022-12-06 05:40:24,177 INFO L131 PetriNetUnfolder]: For 8923/8991 co-relation queries the response was YES. [2022-12-06 05:40:24,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 872 events. 449/872 cut-off events. For 8923/8991 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4611 event pairs, 86 based on Foata normal form. 73/935 useless extension candidates. Maximal degree in co-relation 4873. Up to 486 conditions per place. [2022-12-06 05:40:24,183 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 127 selfloop transitions, 40 changer transitions 1/169 dead transitions. [2022-12-06 05:40:24,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 169 transitions, 2230 flow [2022-12-06 05:40:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:40:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:40:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2022-12-06 05:40:24,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2897727272727273 [2022-12-06 05:40:24,184 INFO L175 Difference]: Start difference. First operand has 71 places, 96 transitions, 1232 flow. Second operand 11 states and 102 transitions. [2022-12-06 05:40:24,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 169 transitions, 2230 flow [2022-12-06 05:40:24,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 2134 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:24,201 INFO L231 Difference]: Finished difference. Result has 83 places, 110 transitions, 1494 flow [2022-12-06 05:40:24,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1494, PETRI_PLACES=83, PETRI_TRANSITIONS=110} [2022-12-06 05:40:24,201 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 05:40:24,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:24,201 INFO L89 Accepts]: Start accepts. Operand has 83 places, 110 transitions, 1494 flow [2022-12-06 05:40:24,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:24,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:24,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 110 transitions, 1494 flow [2022-12-06 05:40:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 110 transitions, 1494 flow [2022-12-06 05:40:24,256 INFO L130 PetriNetUnfolder]: 113/370 cut-off events. [2022-12-06 05:40:24,256 INFO L131 PetriNetUnfolder]: For 3296/3377 co-relation queries the response was YES. [2022-12-06 05:40:24,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 370 events. 113/370 cut-off events. For 3296/3377 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2257 event pairs, 2 based on Foata normal form. 22/383 useless extension candidates. Maximal degree in co-relation 1851. Up to 161 conditions per place. [2022-12-06 05:40:24,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 110 transitions, 1494 flow [2022-12-06 05:40:24,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 05:40:24,264 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,264 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,359 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,359 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,440 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,441 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,518 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,518 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,828 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,828 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,828 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:24,828 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:25,037 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:25,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 837 [2022-12-06 05:40:25,038 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 110 transitions, 1562 flow [2022-12-06 05:40:25,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:25,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:25,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:25,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:25,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:25,239 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1564588506, now seen corresponding path program 1 times [2022-12-06 05:40:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:25,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819856196] [2022-12-06 05:40:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819856196] [2022-12-06 05:40:25,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819856196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:25,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:25,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255118292] [2022-12-06 05:40:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:25,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:25,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:40:25,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 110 transitions, 1562 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:25,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:25,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:40:25,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:25,474 INFO L130 PetriNetUnfolder]: 432/846 cut-off events. [2022-12-06 05:40:25,474 INFO L131 PetriNetUnfolder]: For 10907/10950 co-relation queries the response was YES. [2022-12-06 05:40:25,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5711 conditions, 846 events. 432/846 cut-off events. For 10907/10950 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4506 event pairs, 67 based on Foata normal form. 35/870 useless extension candidates. Maximal degree in co-relation 5120. Up to 683 conditions per place. [2022-12-06 05:40:25,480 INFO L137 encePairwiseOnDemand]: 20/38 looper letters, 84 selfloop transitions, 38 changer transitions 4/127 dead transitions. [2022-12-06 05:40:25,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 127 transitions, 1946 flow [2022-12-06 05:40:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 05:40:25,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2022-12-06 05:40:25,482 INFO L175 Difference]: Start difference. First operand has 83 places, 110 transitions, 1562 flow. Second operand 4 states and 59 transitions. [2022-12-06 05:40:25,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 127 transitions, 1946 flow [2022-12-06 05:40:25,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 1815 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:25,502 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 1491 flow [2022-12-06 05:40:25,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1491, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2022-12-06 05:40:25,503 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 05:40:25,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:25,504 INFO L89 Accepts]: Start accepts. Operand has 83 places, 108 transitions, 1491 flow [2022-12-06 05:40:25,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:25,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:25,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 108 transitions, 1491 flow [2022-12-06 05:40:25,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 1491 flow [2022-12-06 05:40:25,535 INFO L130 PetriNetUnfolder]: 112/363 cut-off events. [2022-12-06 05:40:25,535 INFO L131 PetriNetUnfolder]: For 3298/3373 co-relation queries the response was YES. [2022-12-06 05:40:25,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 363 events. 112/363 cut-off events. For 3298/3373 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2216 event pairs, 3 based on Foata normal form. 19/372 useless extension candidates. Maximal degree in co-relation 1833. Up to 160 conditions per place. [2022-12-06 05:40:25,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 108 transitions, 1491 flow [2022-12-06 05:40:25,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 05:40:25,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:25,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 05:40:25,541 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 108 transitions, 1491 flow [2022-12-06 05:40:25,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:25,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:25,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:25,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:40:25,542 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash 432994741, now seen corresponding path program 1 times [2022-12-06 05:40:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:25,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693049939] [2022-12-06 05:40:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:25,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:25,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693049939] [2022-12-06 05:40:25,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693049939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734793813] [2022-12-06 05:40:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:25,865 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:25,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:40:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:25,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:40:25,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:25,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:26,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:40:26,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:26,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 05:40:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:26,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:26,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:26,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 157 [2022-12-06 05:40:26,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:26,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 94 [2022-12-06 05:40:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:26,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734793813] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:26,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:26,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:40:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494669778] [2022-12-06 05:40:26,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:26,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:40:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:40:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:40:26,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:40:26,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 108 transitions, 1491 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:26,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:26,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:40:26,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:26,721 INFO L130 PetriNetUnfolder]: 464/898 cut-off events. [2022-12-06 05:40:26,722 INFO L131 PetriNetUnfolder]: For 10295/10336 co-relation queries the response was YES. [2022-12-06 05:40:26,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 898 events. 464/898 cut-off events. For 10295/10336 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4723 event pairs, 73 based on Foata normal form. 22/909 useless extension candidates. Maximal degree in co-relation 5689. Up to 710 conditions per place. [2022-12-06 05:40:26,733 INFO L137 encePairwiseOnDemand]: 15/36 looper letters, 90 selfloop transitions, 53 changer transitions 2/146 dead transitions. [2022-12-06 05:40:26,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 146 transitions, 2124 flow [2022-12-06 05:40:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:40:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:40:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-06 05:40:26,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2638888888888889 [2022-12-06 05:40:26,734 INFO L175 Difference]: Start difference. First operand has 82 places, 108 transitions, 1491 flow. Second operand 8 states and 76 transitions. [2022-12-06 05:40:26,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 146 transitions, 2124 flow [2022-12-06 05:40:26,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 146 transitions, 2015 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:26,753 INFO L231 Difference]: Finished difference. Result has 89 places, 120 transitions, 1735 flow [2022-12-06 05:40:26,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1735, PETRI_PLACES=89, PETRI_TRANSITIONS=120} [2022-12-06 05:40:26,754 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 68 predicate places. [2022-12-06 05:40:26,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:26,754 INFO L89 Accepts]: Start accepts. Operand has 89 places, 120 transitions, 1735 flow [2022-12-06 05:40:26,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:26,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:26,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 120 transitions, 1735 flow [2022-12-06 05:40:26,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 120 transitions, 1735 flow [2022-12-06 05:40:26,786 INFO L130 PetriNetUnfolder]: 121/384 cut-off events. [2022-12-06 05:40:26,786 INFO L131 PetriNetUnfolder]: For 3726/3808 co-relation queries the response was YES. [2022-12-06 05:40:26,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 384 events. 121/384 cut-off events. For 3726/3808 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2330 event pairs, 2 based on Foata normal form. 19/393 useless extension candidates. Maximal degree in co-relation 2073. Up to 176 conditions per place. [2022-12-06 05:40:26,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 120 transitions, 1735 flow [2022-12-06 05:40:26,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 05:40:26,794 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:26,794 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:26,874 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:26,875 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:30,105 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:40:30,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3351 [2022-12-06 05:40:30,105 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 119 transitions, 1752 flow [2022-12-06 05:40:30,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:30,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:30,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:30,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:30,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:30,310 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -989187211, now seen corresponding path program 1 times [2022-12-06 05:40:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:30,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532833255] [2022-12-06 05:40:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532833255] [2022-12-06 05:40:30,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532833255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249822118] [2022-12-06 05:40:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:30,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:30,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:30,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:40:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:30,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:40:30,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:30,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:30,790 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:40:30,791 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 26 treesize of output 18 [2022-12-06 05:40:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:30,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249822118] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:30,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:30,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:40:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377546891] [2022-12-06 05:40:30,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:30,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:40:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:40:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:40:30,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:40:30,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 119 transitions, 1752 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:30,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:30,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:40:30,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:31,765 INFO L130 PetriNetUnfolder]: 584/1141 cut-off events. [2022-12-06 05:40:31,765 INFO L131 PetriNetUnfolder]: For 13631/13724 co-relation queries the response was YES. [2022-12-06 05:40:31,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 1141 events. 584/1141 cut-off events. For 13631/13724 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6539 event pairs, 27 based on Foata normal form. 39/1166 useless extension candidates. Maximal degree in co-relation 7747. Up to 587 conditions per place. [2022-12-06 05:40:31,773 INFO L137 encePairwiseOnDemand]: 14/39 looper letters, 132 selfloop transitions, 92 changer transitions 4/229 dead transitions. [2022-12-06 05:40:31,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 229 transitions, 3239 flow [2022-12-06 05:40:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:40:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:40:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2022-12-06 05:40:31,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 05:40:31,774 INFO L175 Difference]: Start difference. First operand has 88 places, 119 transitions, 1752 flow. Second operand 17 states and 156 transitions. [2022-12-06 05:40:31,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 229 transitions, 3239 flow [2022-12-06 05:40:31,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 229 transitions, 3154 flow, removed 37 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:31,801 INFO L231 Difference]: Finished difference. Result has 111 places, 147 transitions, 2530 flow [2022-12-06 05:40:31,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2530, PETRI_PLACES=111, PETRI_TRANSITIONS=147} [2022-12-06 05:40:31,801 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 90 predicate places. [2022-12-06 05:40:31,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:31,801 INFO L89 Accepts]: Start accepts. Operand has 111 places, 147 transitions, 2530 flow [2022-12-06 05:40:31,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:31,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:31,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 147 transitions, 2530 flow [2022-12-06 05:40:31,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 147 transitions, 2530 flow [2022-12-06 05:40:31,845 INFO L130 PetriNetUnfolder]: 142/475 cut-off events. [2022-12-06 05:40:31,845 INFO L131 PetriNetUnfolder]: For 5936/6020 co-relation queries the response was YES. [2022-12-06 05:40:31,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 475 events. 142/475 cut-off events. For 5936/6020 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3193 event pairs, 0 based on Foata normal form. 9/479 useless extension candidates. Maximal degree in co-relation 3110. Up to 228 conditions per place. [2022-12-06 05:40:31,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 147 transitions, 2530 flow [2022-12-06 05:40:31,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 05:40:31,850 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:31,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 05:40:31,852 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 147 transitions, 2530 flow [2022-12-06 05:40:31,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:31,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:31,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:31,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 05:40:32,058 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1958788032, now seen corresponding path program 1 times [2022-12-06 05:40:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:32,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23107715] [2022-12-06 05:40:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23107715] [2022-12-06 05:40:32,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23107715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714701924] [2022-12-06 05:40:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:32,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:32,127 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:32,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:40:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:32,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:40:32,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:32,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:40:32,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714701924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:32,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:40:32,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:40:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013254014] [2022-12-06 05:40:32,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:32,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:32,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:40:32,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 147 transitions, 2530 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:32,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:32,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:40:32,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:32,470 INFO L130 PetriNetUnfolder]: 560/1087 cut-off events. [2022-12-06 05:40:32,470 INFO L131 PetriNetUnfolder]: For 18971/19063 co-relation queries the response was YES. [2022-12-06 05:40:32,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8620 conditions, 1087 events. 560/1087 cut-off events. For 18971/19063 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5991 event pairs, 199 based on Foata normal form. 9/1091 useless extension candidates. Maximal degree in co-relation 8575. Up to 889 conditions per place. [2022-12-06 05:40:32,478 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 154 selfloop transitions, 2 changer transitions 5/162 dead transitions. [2022-12-06 05:40:32,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 162 transitions, 2954 flow [2022-12-06 05:40:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 05:40:32,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2022-12-06 05:40:32,479 INFO L175 Difference]: Start difference. First operand has 110 places, 147 transitions, 2530 flow. Second operand 4 states and 59 transitions. [2022-12-06 05:40:32,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 162 transitions, 2954 flow [2022-12-06 05:40:32,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 162 transitions, 2634 flow, removed 140 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:32,522 INFO L231 Difference]: Finished difference. Result has 110 places, 144 transitions, 2151 flow [2022-12-06 05:40:32,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2151, PETRI_PLACES=110, PETRI_TRANSITIONS=144} [2022-12-06 05:40:32,522 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:40:32,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:32,523 INFO L89 Accepts]: Start accepts. Operand has 110 places, 144 transitions, 2151 flow [2022-12-06 05:40:32,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:32,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:32,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 144 transitions, 2151 flow [2022-12-06 05:40:32,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 144 transitions, 2151 flow [2022-12-06 05:40:32,562 INFO L130 PetriNetUnfolder]: 142/456 cut-off events. [2022-12-06 05:40:32,562 INFO L131 PetriNetUnfolder]: For 4654/4721 co-relation queries the response was YES. [2022-12-06 05:40:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 456 events. 142/456 cut-off events. For 4654/4721 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2966 event pairs, 0 based on Foata normal form. 9/459 useless extension candidates. Maximal degree in co-relation 2622. Up to 206 conditions per place. [2022-12-06 05:40:32,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 144 transitions, 2151 flow [2022-12-06 05:40:32,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 05:40:32,842 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:32,842 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:32,842 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:32,842 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,119 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,120 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,120 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,120 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,120 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,120 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:33,521 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:33,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 998 [2022-12-06 05:40:33,521 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 144 transitions, 2221 flow [2022-12-06 05:40:33,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:33,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:33,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:33,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:33,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-06 05:40:33,726 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:33,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1035214489, now seen corresponding path program 1 times [2022-12-06 05:40:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:33,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354860136] [2022-12-06 05:40:33,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:40:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:33,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354860136] [2022-12-06 05:40:33,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354860136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:33,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:33,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:40:33,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841885176] [2022-12-06 05:40:33,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:33,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:40:33,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:33,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:40:33,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:40:33,773 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:40:33,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 144 transitions, 2221 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:40:33,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:33,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:40:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:33,986 INFO L130 PetriNetUnfolder]: 541/1050 cut-off events. [2022-12-06 05:40:33,986 INFO L131 PetriNetUnfolder]: For 14329/14393 co-relation queries the response was YES. [2022-12-06 05:40:33,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 1050 events. 541/1050 cut-off events. For 14329/14393 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5808 event pairs, 195 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 7178. Up to 860 conditions per place. [2022-12-06 05:40:33,993 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 150 selfloop transitions, 2 changer transitions 1/154 dead transitions. [2022-12-06 05:40:33,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 154 transitions, 2572 flow [2022-12-06 05:40:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:40:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:40:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:40:33,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 05:40:33,994 INFO L175 Difference]: Start difference. First operand has 108 places, 144 transitions, 2221 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:40:33,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 154 transitions, 2572 flow [2022-12-06 05:40:34,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 154 transitions, 2474 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-06 05:40:34,025 INFO L231 Difference]: Finished difference. Result has 103 places, 140 transitions, 2041 flow [2022-12-06 05:40:34,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2041, PETRI_PLACES=103, PETRI_TRANSITIONS=140} [2022-12-06 05:40:34,026 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 05:40:34,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:34,026 INFO L89 Accepts]: Start accepts. Operand has 103 places, 140 transitions, 2041 flow [2022-12-06 05:40:34,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:34,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:34,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 140 transitions, 2041 flow [2022-12-06 05:40:34,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 140 transitions, 2041 flow [2022-12-06 05:40:34,065 INFO L130 PetriNetUnfolder]: 138/447 cut-off events. [2022-12-06 05:40:34,065 INFO L131 PetriNetUnfolder]: For 4202/4259 co-relation queries the response was YES. [2022-12-06 05:40:34,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 447 events. 138/447 cut-off events. For 4202/4259 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2899 event pairs, 0 based on Foata normal form. 9/452 useless extension candidates. Maximal degree in co-relation 2562. Up to 203 conditions per place. [2022-12-06 05:40:34,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 140 transitions, 2041 flow [2022-12-06 05:40:34,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 05:40:34,069 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:34,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 05:40:34,071 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 140 transitions, 2041 flow [2022-12-06 05:40:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:40:34,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:34,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:34,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:40:34,072 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1079276683, now seen corresponding path program 2 times [2022-12-06 05:40:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:34,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066228531] [2022-12-06 05:40:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:34,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066228531] [2022-12-06 05:40:34,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066228531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:34,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312054942] [2022-12-06 05:40:34,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:40:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:34,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:34,292 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:34,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:40:34,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:40:34,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:40:34,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:40:34,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:34,533 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-06 05:40:34,533 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 23 treesize of output 15 [2022-12-06 05:40:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:34,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:34,609 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:40:34,609 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 26 treesize of output 18 [2022-12-06 05:40:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:34,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312054942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:34,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:34,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:40:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121296338] [2022-12-06 05:40:34,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:34,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:40:34,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:34,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:40:34,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:40:34,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:40:34,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 140 transitions, 2041 flow. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:34,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:34,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:40:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:35,364 INFO L130 PetriNetUnfolder]: 526/1081 cut-off events. [2022-12-06 05:40:35,364 INFO L131 PetriNetUnfolder]: For 13505/13523 co-relation queries the response was YES. [2022-12-06 05:40:35,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 1081 events. 526/1081 cut-off events. For 13505/13523 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6360 event pairs, 52 based on Foata normal form. 91/1160 useless extension candidates. Maximal degree in co-relation 7221. Up to 488 conditions per place. [2022-12-06 05:40:35,372 INFO L137 encePairwiseOnDemand]: 9/36 looper letters, 119 selfloop transitions, 63 changer transitions 19/202 dead transitions. [2022-12-06 05:40:35,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 202 transitions, 2903 flow [2022-12-06 05:40:35,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:40:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:40:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2022-12-06 05:40:35,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.234375 [2022-12-06 05:40:35,373 INFO L175 Difference]: Start difference. First operand has 102 places, 140 transitions, 2041 flow. Second operand 16 states and 135 transitions. [2022-12-06 05:40:35,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 202 transitions, 2903 flow [2022-12-06 05:40:35,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 202 transitions, 2893 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:35,407 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 2072 flow [2022-12-06 05:40:35,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2072, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2022-12-06 05:40:35,408 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 98 predicate places. [2022-12-06 05:40:35,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:35,408 INFO L89 Accepts]: Start accepts. Operand has 119 places, 127 transitions, 2072 flow [2022-12-06 05:40:35,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:35,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:35,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 127 transitions, 2072 flow [2022-12-06 05:40:35,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 127 transitions, 2072 flow [2022-12-06 05:40:35,444 INFO L130 PetriNetUnfolder]: 108/407 cut-off events. [2022-12-06 05:40:35,444 INFO L131 PetriNetUnfolder]: For 4819/4880 co-relation queries the response was YES. [2022-12-06 05:40:35,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 407 events. 108/407 cut-off events. For 4819/4880 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2702 event pairs, 2 based on Foata normal form. 9/411 useless extension candidates. Maximal degree in co-relation 2362. Up to 174 conditions per place. [2022-12-06 05:40:35,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 127 transitions, 2072 flow [2022-12-06 05:40:35,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 05:40:35,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:35,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 342 [2022-12-06 05:40:35,750 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 127 transitions, 2076 flow [2022-12-06 05:40:35,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:35,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:35,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:35,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:35,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 05:40:35,951 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash -764301825, now seen corresponding path program 1 times [2022-12-06 05:40:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:35,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836030284] [2022-12-06 05:40:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:36,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836030284] [2022-12-06 05:40:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836030284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:36,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:36,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:36,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798963037] [2022-12-06 05:40:36,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:36,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:40:36,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 127 transitions, 2076 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:36,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:36,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:40:36,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:36,540 INFO L130 PetriNetUnfolder]: 565/1166 cut-off events. [2022-12-06 05:40:36,541 INFO L131 PetriNetUnfolder]: For 18299/18320 co-relation queries the response was YES. [2022-12-06 05:40:36,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8678 conditions, 1166 events. 565/1166 cut-off events. For 18299/18320 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6966 event pairs, 76 based on Foata normal form. 6/1160 useless extension candidates. Maximal degree in co-relation 7924. Up to 852 conditions per place. [2022-12-06 05:40:36,549 INFO L137 encePairwiseOnDemand]: 12/34 looper letters, 110 selfloop transitions, 59 changer transitions 0/170 dead transitions. [2022-12-06 05:40:36,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 170 transitions, 2898 flow [2022-12-06 05:40:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 05:40:36,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2022-12-06 05:40:36,550 INFO L175 Difference]: Start difference. First operand has 113 places, 127 transitions, 2076 flow. Second operand 5 states and 65 transitions. [2022-12-06 05:40:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 170 transitions, 2898 flow [2022-12-06 05:40:36,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 170 transitions, 2717 flow, removed 37 selfloop flow, removed 10 redundant places. [2022-12-06 05:40:36,603 INFO L231 Difference]: Finished difference. Result has 110 places, 146 transitions, 2440 flow [2022-12-06 05:40:36,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2440, PETRI_PLACES=110, PETRI_TRANSITIONS=146} [2022-12-06 05:40:36,605 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:40:36,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:36,605 INFO L89 Accepts]: Start accepts. Operand has 110 places, 146 transitions, 2440 flow [2022-12-06 05:40:36,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:36,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:36,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 146 transitions, 2440 flow [2022-12-06 05:40:36,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 146 transitions, 2440 flow [2022-12-06 05:40:36,663 INFO L130 PetriNetUnfolder]: 126/491 cut-off events. [2022-12-06 05:40:36,663 INFO L131 PetriNetUnfolder]: For 5756/5852 co-relation queries the response was YES. [2022-12-06 05:40:36,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 491 events. 126/491 cut-off events. For 5756/5852 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3521 event pairs, 3 based on Foata normal form. 20/504 useless extension candidates. Maximal degree in co-relation 2820. Up to 196 conditions per place. [2022-12-06 05:40:36,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 146 transitions, 2440 flow [2022-12-06 05:40:36,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-06 05:40:36,671 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:36,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 05:40:36,671 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 146 transitions, 2440 flow [2022-12-06 05:40:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:36,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:36,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:36,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:40:36,672 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash 903569305, now seen corresponding path program 1 times [2022-12-06 05:40:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:36,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129702240] [2022-12-06 05:40:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:40:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:36,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129702240] [2022-12-06 05:40:36,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129702240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:36,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:36,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:36,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340400804] [2022-12-06 05:40:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:36,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:36,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:36,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:36,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:40:36,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 146 transitions, 2440 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:36,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:36,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:40:36,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:36,912 INFO L130 PetriNetUnfolder]: 360/763 cut-off events. [2022-12-06 05:40:36,912 INFO L131 PetriNetUnfolder]: For 13245/13281 co-relation queries the response was YES. [2022-12-06 05:40:36,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5780 conditions, 763 events. 360/763 cut-off events. For 13245/13281 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4203 event pairs, 141 based on Foata normal form. 38/797 useless extension candidates. Maximal degree in co-relation 5464. Up to 704 conditions per place. [2022-12-06 05:40:36,917 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 107 selfloop transitions, 0 changer transitions 18/126 dead transitions. [2022-12-06 05:40:36,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 126 transitions, 2293 flow [2022-12-06 05:40:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 05:40:36,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-06 05:40:36,918 INFO L175 Difference]: Start difference. First operand has 110 places, 146 transitions, 2440 flow. Second operand 4 states and 47 transitions. [2022-12-06 05:40:36,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 126 transitions, 2293 flow [2022-12-06 05:40:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 126 transitions, 2181 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-06 05:40:36,944 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1687 flow [2022-12-06 05:40:36,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1687, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2022-12-06 05:40:36,948 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 83 predicate places. [2022-12-06 05:40:36,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:36,948 INFO L89 Accepts]: Start accepts. Operand has 104 places, 108 transitions, 1687 flow [2022-12-06 05:40:36,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:36,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:36,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 108 transitions, 1687 flow [2022-12-06 05:40:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 108 transitions, 1687 flow [2022-12-06 05:40:36,976 INFO L130 PetriNetUnfolder]: 82/315 cut-off events. [2022-12-06 05:40:36,976 INFO L131 PetriNetUnfolder]: For 3313/3383 co-relation queries the response was YES. [2022-12-06 05:40:36,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 315 events. 82/315 cut-off events. For 3313/3383 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1966 event pairs, 1 based on Foata normal form. 10/321 useless extension candidates. Maximal degree in co-relation 1823. Up to 124 conditions per place. [2022-12-06 05:40:36,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 108 transitions, 1687 flow [2022-12-06 05:40:36,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 05:40:36,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_293| v_~q~0.base_204))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_149| 1) |v_thread1Thread1of1ForFork0_~i~0#1_148|) (= v_~q_back~0_366 (+ v_~q_back~0_367 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_149| v_~N~0_153) (= (ite (and (< v_~q_front~0_244 v_~n~0_215) (< v_~q_front~0_244 v_~q_back~0_367) (<= 0 v_~q_front~0_244)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_93| v_~s~0_178) v_~s~0_177) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134| 0)) (= (+ 1 v_~q_front~0_244) v_~q_front~0_243) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|) (= (select .cse0 (+ (* 4 v_~q_front~0_244) v_~q~0.offset_204)) |v_thread2Thread1of1ForFork1_~j~0#1_93|) (not (= (ite (and (< v_~q_back~0_367 v_~n~0_215) (<= 0 v_~q_back~0_367)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_367 4) v_~q~0.offset_204)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_93| 0)))) InVars {~q_back~0=v_~q_back~0_367, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_293|, ~N~0=v_~N~0_153, ~q~0.base=v_~q~0.base_204, ~n~0=v_~n~0_215, ~q~0.offset=v_~q~0.offset_204, ~s~0=v_~s~0_178, ~q_front~0=v_~q_front~0_244} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_93|, ~q_back~0=v_~q_back~0_366, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_82|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_86|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_82|, ~N~0=v_~N~0_153, ~q~0.base=v_~q~0.base_204, ~q~0.offset=v_~q~0.offset_204, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_82|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_90|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_86|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_134|, #memory_int=|v_#memory_int_293|, ~n~0=v_~n~0_215, ~s~0=v_~s~0_177, ~q_front~0=v_~q_front~0_243} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:36,990 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:36,990 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:36,990 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:36,990 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:36,990 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:36,990 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:37,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_271| v_~q~0.base_186)) (.cse2 (* v_~q_back~0_322 4))) (and (not (= (ite (let ((.cse0 (+ v_~q_back~0_322 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_197))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_135 1)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|) (not (= (ite (and (< v_~q_back~0_322 v_~n~0_197) (<= 0 v_~q_back~0_322)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (= (+ 2 v_~q_back~0_322) v_~q_back~0_320) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 2))) InVars {~q_back~0=v_~q_back~0_322, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_68|, ~q_back~0=v_~q_back~0_320, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:37,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_271| v_~q~0.base_186)) (.cse2 (* v_~q_back~0_322 4))) (and (not (= (ite (let ((.cse0 (+ v_~q_back~0_322 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_197))) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_118| (+ v_~N~0_135 1)) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_186 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|) (not (= (ite (and (< v_~q_back~0_322 v_~n~0_197) (<= 0 v_~q_back~0_322)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (= (+ 2 v_~q_back~0_322) v_~q_back~0_320) (= |v_thread1Thread1of1ForFork0_~i~0#1_118| 2))) InVars {~q_back~0=v_~q_back~0_322, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_68|, ~q_back~0=v_~q_back~0_320, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ~N~0=v_~N~0_135, ~q~0.base=v_~q~0.base_186, ~n~0=v_~n~0_197, ~q~0.offset=v_~q~0.offset_186} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:40:37,678 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:37,678 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:37,678 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:37,678 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:38,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (+ v_~q_back~0_362 1)) (.cse1 (select |v_#memory_int_291| v_~q~0.base_202)) (.cse2 (* v_~q_back~0_362 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80| (ite (and (< v_~q_front~0_240 .cse0) (<= 0 v_~q_front~0_240) (< v_~q_front~0_240 v_~n~0_213)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_144| 2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_213)) 1 0) 0)) (= (select .cse1 (+ v_~q~0.offset_202 (* 4 v_~q_front~0_240))) |v_thread2Thread1of1ForFork1_~j~0#1_91|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_130| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|) (= (+ 2 v_~q_back~0_362) v_~q_back~0_360) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_202 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_130|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130| 0)) (= v_~s~0_173 (+ |v_thread2Thread1of1ForFork1_~j~0#1_91| v_~s~0_174)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|) (< 1 v_~N~0_151) (= (+ 1 v_~q_front~0_240) v_~q_front~0_239) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_202)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_91| 0)))) InVars {~q_back~0=v_~q_back~0_362, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_151, ~q~0.base=v_~q~0.base_202, ~n~0=v_~n~0_213, ~q~0.offset=v_~q~0.offset_202, ~s~0=v_~s~0_174, ~q_front~0=v_~q_front~0_240} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_91|, ~q_back~0=v_~q_back~0_360, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_82|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_80|, ~N~0=v_~N~0_151, ~q~0.base=v_~q~0.base_202, ~q~0.offset=v_~q~0.offset_202, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_130|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_86|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_82|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_144|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|, #memory_int=|v_#memory_int_291|, ~n~0=v_~n~0_213, ~s~0=v_~s~0_173, ~q_front~0=v_~q_front~0_239} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:38,609 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:40:38,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1661 [2022-12-06 05:40:38,609 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 107 transitions, 1779 flow [2022-12-06 05:40:38,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:38,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:38,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:38,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:40:38,610 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:38,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash 979834023, now seen corresponding path program 2 times [2022-12-06 05:40:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:38,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590132834] [2022-12-06 05:40:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590132834] [2022-12-06 05:40:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590132834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:39,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:39,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:40:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260972488] [2022-12-06 05:40:39,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:39,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:39,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:39,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:40:39,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 107 transitions, 1779 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:40:39,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:39,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:40:39,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:39,223 INFO L130 PetriNetUnfolder]: 385/786 cut-off events. [2022-12-06 05:40:39,223 INFO L131 PetriNetUnfolder]: For 12486/12560 co-relation queries the response was YES. [2022-12-06 05:40:39,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5873 conditions, 786 events. 385/786 cut-off events. For 12486/12560 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4323 event pairs, 77 based on Foata normal form. 37/819 useless extension candidates. Maximal degree in co-relation 5743. Up to 653 conditions per place. [2022-12-06 05:40:39,227 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 104 selfloop transitions, 27 changer transitions 4/136 dead transitions. [2022-12-06 05:40:39,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 2387 flow [2022-12-06 05:40:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:40:39,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:40:39,228 INFO L175 Difference]: Start difference. First operand has 92 places, 107 transitions, 1779 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:40:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 2387 flow [2022-12-06 05:40:39,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 136 transitions, 2225 flow, removed 72 selfloop flow, removed 7 redundant places. [2022-12-06 05:40:39,251 INFO L231 Difference]: Finished difference. Result has 91 places, 114 transitions, 1814 flow [2022-12-06 05:40:39,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1814, PETRI_PLACES=91, PETRI_TRANSITIONS=114} [2022-12-06 05:40:39,251 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 05:40:39,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:39,252 INFO L89 Accepts]: Start accepts. Operand has 91 places, 114 transitions, 1814 flow [2022-12-06 05:40:39,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:39,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:39,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 114 transitions, 1814 flow [2022-12-06 05:40:39,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 114 transitions, 1814 flow [2022-12-06 05:40:39,284 INFO L130 PetriNetUnfolder]: 92/339 cut-off events. [2022-12-06 05:40:39,284 INFO L131 PetriNetUnfolder]: For 4074/4192 co-relation queries the response was YES. [2022-12-06 05:40:39,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 339 events. 92/339 cut-off events. For 4074/4192 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2156 event pairs, 1 based on Foata normal form. 30/365 useless extension candidates. Maximal degree in co-relation 2019. Up to 130 conditions per place. [2022-12-06 05:40:39,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 114 transitions, 1814 flow [2022-12-06 05:40:39,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 05:40:39,289 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:39,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 05:40:39,291 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 114 transitions, 1814 flow [2022-12-06 05:40:39,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:40:39,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:39,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:39,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:40:39,292 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1976844517, now seen corresponding path program 3 times [2022-12-06 05:40:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:39,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116500643] [2022-12-06 05:40:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:39,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116500643] [2022-12-06 05:40:39,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116500643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:39,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:39,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842734771] [2022-12-06 05:40:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:39,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:39,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:39,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:39,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:40:39,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 114 transitions, 1814 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:39,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:39,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:40:39,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:39,733 INFO L130 PetriNetUnfolder]: 381/768 cut-off events. [2022-12-06 05:40:39,734 INFO L131 PetriNetUnfolder]: For 11167/11241 co-relation queries the response was YES. [2022-12-06 05:40:39,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 768 events. 381/768 cut-off events. For 11167/11241 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4102 event pairs, 46 based on Foata normal form. 38/802 useless extension candidates. Maximal degree in co-relation 5585. Up to 560 conditions per place. [2022-12-06 05:40:39,739 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 95 selfloop transitions, 37 changer transitions 2/135 dead transitions. [2022-12-06 05:40:39,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 2276 flow [2022-12-06 05:40:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 05:40:39,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2022-12-06 05:40:39,741 INFO L175 Difference]: Start difference. First operand has 89 places, 114 transitions, 1814 flow. Second operand 5 states and 58 transitions. [2022-12-06 05:40:39,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 2276 flow [2022-12-06 05:40:39,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 2139 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-06 05:40:39,765 INFO L231 Difference]: Finished difference. Result has 90 places, 115 transitions, 1808 flow [2022-12-06 05:40:39,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=90, PETRI_TRANSITIONS=115} [2022-12-06 05:40:39,766 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 05:40:39,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:39,766 INFO L89 Accepts]: Start accepts. Operand has 90 places, 115 transitions, 1808 flow [2022-12-06 05:40:39,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:39,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:39,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 115 transitions, 1808 flow [2022-12-06 05:40:39,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 115 transitions, 1808 flow [2022-12-06 05:40:39,810 INFO L130 PetriNetUnfolder]: 92/330 cut-off events. [2022-12-06 05:40:39,810 INFO L131 PetriNetUnfolder]: For 3919/4013 co-relation queries the response was YES. [2022-12-06 05:40:39,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 330 events. 92/330 cut-off events. For 3919/4013 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2048 event pairs, 1 based on Foata normal form. 29/355 useless extension candidates. Maximal degree in co-relation 1921. Up to 126 conditions per place. [2022-12-06 05:40:39,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 115 transitions, 1808 flow [2022-12-06 05:40:39,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 05:40:39,813 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:39,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 05:40:39,813 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 115 transitions, 1808 flow [2022-12-06 05:40:39,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:39,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:39,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:40:39,814 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash 499908419, now seen corresponding path program 4 times [2022-12-06 05:40:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:39,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453790730] [2022-12-06 05:40:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453790730] [2022-12-06 05:40:40,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453790730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:40,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:40,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264652769] [2022-12-06 05:40:40,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:40,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:40,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:40,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:40:40,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 115 transitions, 1808 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:40,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:40,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:40:40,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:40,451 INFO L130 PetriNetUnfolder]: 389/775 cut-off events. [2022-12-06 05:40:40,452 INFO L131 PetriNetUnfolder]: For 11360/11414 co-relation queries the response was YES. [2022-12-06 05:40:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5663 conditions, 775 events. 389/775 cut-off events. For 11360/11414 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4062 event pairs, 44 based on Foata normal form. 32/803 useless extension candidates. Maximal degree in co-relation 5527. Up to 566 conditions per place. [2022-12-06 05:40:40,456 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 90 selfloop transitions, 44 changer transitions 0/135 dead transitions. [2022-12-06 05:40:40,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 135 transitions, 2260 flow [2022-12-06 05:40:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 05:40:40,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2022-12-06 05:40:40,472 INFO L175 Difference]: Start difference. First operand has 90 places, 115 transitions, 1808 flow. Second operand 5 states and 57 transitions. [2022-12-06 05:40:40,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 135 transitions, 2260 flow [2022-12-06 05:40:40,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 2195 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:40,493 INFO L231 Difference]: Finished difference. Result has 92 places, 119 transitions, 1928 flow [2022-12-06 05:40:40,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1729, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1928, PETRI_PLACES=92, PETRI_TRANSITIONS=119} [2022-12-06 05:40:40,493 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2022-12-06 05:40:40,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:40,493 INFO L89 Accepts]: Start accepts. Operand has 92 places, 119 transitions, 1928 flow [2022-12-06 05:40:40,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:40,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:40,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 119 transitions, 1928 flow [2022-12-06 05:40:40,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 119 transitions, 1928 flow [2022-12-06 05:40:40,523 INFO L130 PetriNetUnfolder]: 96/336 cut-off events. [2022-12-06 05:40:40,523 INFO L131 PetriNetUnfolder]: For 4040/4126 co-relation queries the response was YES. [2022-12-06 05:40:40,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 336 events. 96/336 cut-off events. For 4040/4126 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2073 event pairs, 1 based on Foata normal form. 25/357 useless extension candidates. Maximal degree in co-relation 1803. Up to 131 conditions per place. [2022-12-06 05:40:40,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 119 transitions, 1928 flow [2022-12-06 05:40:40,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 05:40:40,526 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:40,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:40:40,528 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 119 transitions, 1928 flow [2022-12-06 05:40:40,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:40,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:40,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:40,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:40:40,529 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1030656879, now seen corresponding path program 1 times [2022-12-06 05:40:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:40,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82273956] [2022-12-06 05:40:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:40,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:40,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82273956] [2022-12-06 05:40:40,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82273956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:40,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804685316] [2022-12-06 05:40:40,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:40,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:40,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:40,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:40,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:40:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:40,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:40:40,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:41,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:41,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:40:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:41,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:41,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:41,186 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 42 [2022-12-06 05:40:41,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:40:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:41,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804685316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:41,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:41,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:40:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95129967] [2022-12-06 05:40:41,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:41,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:40:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:40:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:40:41,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:40:41,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 119 transitions, 1928 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:41,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:41,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:40:41,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:41,935 INFO L130 PetriNetUnfolder]: 440/886 cut-off events. [2022-12-06 05:40:41,936 INFO L131 PetriNetUnfolder]: For 14779/14833 co-relation queries the response was YES. [2022-12-06 05:40:41,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 886 events. 440/886 cut-off events. For 14779/14833 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4943 event pairs, 69 based on Foata normal form. 39/921 useless extension candidates. Maximal degree in co-relation 5860. Up to 401 conditions per place. [2022-12-06 05:40:41,940 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 127 selfloop transitions, 53 changer transitions 0/181 dead transitions. [2022-12-06 05:40:41,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 181 transitions, 2846 flow [2022-12-06 05:40:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:40:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:40:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-12-06 05:40:41,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29301075268817206 [2022-12-06 05:40:41,941 INFO L175 Difference]: Start difference. First operand has 92 places, 119 transitions, 1928 flow. Second operand 12 states and 109 transitions. [2022-12-06 05:40:41,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 181 transitions, 2846 flow [2022-12-06 05:40:41,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 181 transitions, 2787 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:41,966 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 2238 flow [2022-12-06 05:40:41,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2238, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2022-12-06 05:40:41,967 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 05:40:41,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:41,967 INFO L89 Accepts]: Start accepts. Operand has 107 places, 129 transitions, 2238 flow [2022-12-06 05:40:41,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:41,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:41,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 129 transitions, 2238 flow [2022-12-06 05:40:41,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 129 transitions, 2238 flow [2022-12-06 05:40:42,012 INFO L130 PetriNetUnfolder]: 103/372 cut-off events. [2022-12-06 05:40:42,013 INFO L131 PetriNetUnfolder]: For 5494/5611 co-relation queries the response was YES. [2022-12-06 05:40:42,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 372 events. 103/372 cut-off events. For 5494/5611 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2416 event pairs, 1 based on Foata normal form. 28/394 useless extension candidates. Maximal degree in co-relation 2366. Up to 148 conditions per place. [2022-12-06 05:40:42,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 129 transitions, 2238 flow [2022-12-06 05:40:42,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 05:40:42,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:42,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:42,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:40:42,167 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 128 transitions, 2232 flow [2022-12-06 05:40:42,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:42,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:42,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:42,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:42,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-06 05:40:42,368 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash 399427691, now seen corresponding path program 1 times [2022-12-06 05:40:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:42,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643000494] [2022-12-06 05:40:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:42,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:42,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643000494] [2022-12-06 05:40:42,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643000494] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:42,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492604291] [2022-12-06 05:40:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:42,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:42,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:42,781 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:40:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:42,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:40:42,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:42,895 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-12-06 05:40:42,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 49 [2022-12-06 05:40:42,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:42,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-12-06 05:40:42,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:40:43,044 INFO L321 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2022-12-06 05:40:43,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 18 [2022-12-06 05:40:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:43,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:43,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492604291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:43,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:43,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:40:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312239691] [2022-12-06 05:40:43,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:43,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:40:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:40:43,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2022-12-06 05:40:43,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 05:40:43,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 128 transitions, 2232 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:43,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:43,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 05:40:43,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:43,880 INFO L130 PetriNetUnfolder]: 437/881 cut-off events. [2022-12-06 05:40:43,880 INFO L131 PetriNetUnfolder]: For 16643/16661 co-relation queries the response was YES. [2022-12-06 05:40:43,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6879 conditions, 881 events. 437/881 cut-off events. For 16643/16661 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4842 event pairs, 81 based on Foata normal form. 7/886 useless extension candidates. Maximal degree in co-relation 6612. Up to 440 conditions per place. [2022-12-06 05:40:43,885 INFO L137 encePairwiseOnDemand]: 10/32 looper letters, 131 selfloop transitions, 36 changer transitions 2/170 dead transitions. [2022-12-06 05:40:43,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 170 transitions, 2924 flow [2022-12-06 05:40:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:40:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:40:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-12-06 05:40:43,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.284375 [2022-12-06 05:40:43,888 INFO L175 Difference]: Start difference. First operand has 106 places, 128 transitions, 2232 flow. Second operand 10 states and 91 transitions. [2022-12-06 05:40:43,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 170 transitions, 2924 flow [2022-12-06 05:40:43,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 170 transitions, 2846 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 05:40:43,918 INFO L231 Difference]: Finished difference. Result has 114 places, 132 transitions, 2339 flow [2022-12-06 05:40:43,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2155, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2339, PETRI_PLACES=114, PETRI_TRANSITIONS=132} [2022-12-06 05:40:43,918 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 05:40:43,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:43,918 INFO L89 Accepts]: Start accepts. Operand has 114 places, 132 transitions, 2339 flow [2022-12-06 05:40:43,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:43,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:43,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 132 transitions, 2339 flow [2022-12-06 05:40:43,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 132 transitions, 2339 flow [2022-12-06 05:40:43,953 INFO L130 PetriNetUnfolder]: 103/370 cut-off events. [2022-12-06 05:40:43,953 INFO L131 PetriNetUnfolder]: For 5434/5532 co-relation queries the response was YES. [2022-12-06 05:40:43,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 370 events. 103/370 cut-off events. For 5434/5532 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2381 event pairs, 1 based on Foata normal form. 25/389 useless extension candidates. Maximal degree in co-relation 2326. Up to 148 conditions per place. [2022-12-06 05:40:43,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 132 transitions, 2339 flow [2022-12-06 05:40:43,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 05:40:43,961 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:43,962 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_396| v_~q~0.base_271)) (.cse1 (* v_~q_back~0_517 4))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_175| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_66| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_158| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_158|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_158| (ite (and (<= 0 v_~q_front~0_370) (< v_~q_front~0_370 v_~n~0_282) (< v_~q_front~0_370 (+ v_~q_back~0_517 1))) 1 0)) (= (+ v_~s~0_296 |v_thread2Thread1of1ForFork1_~j~0#1_175|) v_~s~0_295) (= (select .cse0 (+ (* 4 v_~q_front~0_370) v_~q~0.offset_271)) |v_thread2Thread1of1ForFork1_~j~0#1_175|) (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_271 .cse1)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_227| v_~N~0_200)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_214| 0)) (= (+ 1 v_~q_front~0_370) v_~q_front~0_369) (= |v_thread1Thread1of1ForFork0_~i~0#1_227| 2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_158| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_271 .cse1)) 1) 1 0) 0)) (= (+ 3 v_~q_back~0_517) v_~q_back~0_515) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_214|) (= |v_thread1Thread1of1ForFork0_#res#1.base_66| 0) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_271 4 .cse1)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_517))) (and (< .cse2 v_~n~0_282) (<= 0 .cse2))) 1 0) 0)) (< 1 v_~N~0_200))) InVars {~q_back~0=v_~q_back~0_517, #memory_int=|v_#memory_int_396|, ~N~0=v_~N~0_200, ~q~0.base=v_~q~0.base_271, ~n~0=v_~n~0_282, ~q~0.offset=v_~q~0.offset_271, ~s~0=v_~s~0_296, ~q_front~0=v_~q_front~0_370} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_175|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_66|, ~q_back~0=v_~q_back~0_515, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_158|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_151|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_158|, ~N~0=v_~N~0_200, ~q~0.base=v_~q~0.base_271, ~q~0.offset=v_~q~0.offset_271, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_158|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_155|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_151|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_227|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_214|, #memory_int=|v_#memory_int_396|, ~n~0=v_~n~0_282, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_66|, ~s~0=v_~s~0_295, ~q_front~0=v_~q_front~0_369} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:44,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] L65-2-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_382| v_~q~0.base_259)) (.cse2 (* v_~q_back~0_487 4))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_62| 0) (= (+ v_~s~0_282 |v_thread2Thread1of1ForFork1_~j~0#1_167|) v_~s~0_281) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_211| v_~N~0_188)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_62| 0) (not (= (ite (let ((.cse0 (+ v_~q_back~0_487 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_270))) 1 0) 0)) (= (+ 2 v_~q_back~0_487) v_~q_back~0_485) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_150| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_150|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_259)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_212| v_~N~0_188) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_150| (ite (and (< v_~q_front~0_356 v_~q_back~0_487) (<= 0 v_~q_front~0_356) (< v_~q_front~0_356 v_~n~0_270)) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_167| (select .cse1 (+ (* 4 v_~q_front~0_356) v_~q~0.offset_259))) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_259 4)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_150| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|) (= (+ 1 v_~q_front~0_356) v_~q_front~0_355) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_167| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_211| (+ |v_thread1Thread1of1ForFork0_~i~0#1_212| 1)))) InVars {~q_back~0=v_~q_back~0_487, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_212|, #memory_int=|v_#memory_int_382|, ~N~0=v_~N~0_188, ~q~0.base=v_~q~0.base_259, ~n~0=v_~n~0_270, ~q~0.offset=v_~q~0.offset_259, ~s~0=v_~s~0_282, ~q_front~0=v_~q_front~0_356} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_167|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_62|, ~q_back~0=v_~q_back~0_485, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_150|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_137|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_150|, ~N~0=v_~N~0_188, ~q~0.base=v_~q~0.base_259, ~q~0.offset=v_~q~0.offset_259, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_150|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_150|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_141|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_137|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_211|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|, #memory_int=|v_#memory_int_382|, ~n~0=v_~n~0_270, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_62|, ~s~0=v_~s~0_281, ~q_front~0=v_~q_front~0_355} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:44,545 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,546 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:44,905 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:40:44,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 989 [2022-12-06 05:40:44,907 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 2311 flow [2022-12-06 05:40:44,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:44,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:44,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:44,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:45,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:45,114 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 884715389, now seen corresponding path program 1 times [2022-12-06 05:40:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157288558] [2022-12-06 05:40:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157288558] [2022-12-06 05:40:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157288558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225855609] [2022-12-06 05:40:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:45,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:45,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:45,532 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:45,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 05:40:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:45,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:40:45,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:45,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:45,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:40:45,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:45,710 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 46 treesize of output 12 [2022-12-06 05:40:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:45,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:45,849 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-06 05:40:45,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 139 [2022-12-06 05:40:45,861 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-06 05:40:45,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 76 [2022-12-06 05:40:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:45,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225855609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:45,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:45,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:40:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615288925] [2022-12-06 05:40:45,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:45,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:40:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:40:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:40:45,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 05:40:45,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 2311 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:45,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:45,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 05:40:45,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:46,759 INFO L130 PetriNetUnfolder]: 547/1087 cut-off events. [2022-12-06 05:40:46,759 INFO L131 PetriNetUnfolder]: For 25906/25941 co-relation queries the response was YES. [2022-12-06 05:40:46,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9101 conditions, 1087 events. 547/1087 cut-off events. For 25906/25941 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6345 event pairs, 74 based on Foata normal form. 20/1107 useless extension candidates. Maximal degree in co-relation 8364. Up to 683 conditions per place. [2022-12-06 05:40:46,764 INFO L137 encePairwiseOnDemand]: 7/32 looper letters, 126 selfloop transitions, 60 changer transitions 5/192 dead transitions. [2022-12-06 05:40:46,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 192 transitions, 3444 flow [2022-12-06 05:40:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:40:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:40:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2022-12-06 05:40:46,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2682291666666667 [2022-12-06 05:40:46,765 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 2311 flow. Second operand 12 states and 103 transitions. [2022-12-06 05:40:46,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 192 transitions, 3444 flow [2022-12-06 05:40:46,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 192 transitions, 3348 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 05:40:46,799 INFO L231 Difference]: Finished difference. Result has 124 places, 153 transitions, 2944 flow [2022-12-06 05:40:46,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2944, PETRI_PLACES=124, PETRI_TRANSITIONS=153} [2022-12-06 05:40:46,800 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 05:40:46,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:46,800 INFO L89 Accepts]: Start accepts. Operand has 124 places, 153 transitions, 2944 flow [2022-12-06 05:40:46,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:46,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:46,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 153 transitions, 2944 flow [2022-12-06 05:40:46,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 153 transitions, 2944 flow [2022-12-06 05:40:46,843 INFO L130 PetriNetUnfolder]: 125/437 cut-off events. [2022-12-06 05:40:46,843 INFO L131 PetriNetUnfolder]: For 8107/8246 co-relation queries the response was YES. [2022-12-06 05:40:46,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 437 events. 125/437 cut-off events. For 8107/8246 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2950 event pairs, 1 based on Foata normal form. 30/464 useless extension candidates. Maximal degree in co-relation 3211. Up to 190 conditions per place. [2022-12-06 05:40:46,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 153 transitions, 2944 flow [2022-12-06 05:40:46,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-06 05:40:46,851 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:46,851 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,204 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,204 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,204 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,204 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,204 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,204 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,205 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,205 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,205 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,205 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:47,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:47,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 845 [2022-12-06 05:40:47,646 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 2943 flow [2022-12-06 05:40:47,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:47,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:47,646 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:47,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 05:40:47,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:47,851 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash 250881904, now seen corresponding path program 1 times [2022-12-06 05:40:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:47,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204580785] [2022-12-06 05:40:47,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204580785] [2022-12-06 05:40:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204580785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564596779] [2022-12-06 05:40:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:47,912 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:47,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 05:40:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:48,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:40:48,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:48,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:40:48,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564596779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:48,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:40:48,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:40:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97132860] [2022-12-06 05:40:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:48,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 05:40:48,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 2943 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:48,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:48,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 05:40:48,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:48,282 INFO L130 PetriNetUnfolder]: 504/997 cut-off events. [2022-12-06 05:40:48,282 INFO L131 PetriNetUnfolder]: For 25563/25660 co-relation queries the response was YES. [2022-12-06 05:40:48,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8697 conditions, 997 events. 504/997 cut-off events. For 25563/25660 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5613 event pairs, 195 based on Foata normal form. 26/1022 useless extension candidates. Maximal degree in co-relation 8584. Up to 667 conditions per place. [2022-12-06 05:40:48,289 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 159 selfloop transitions, 1 changer transitions 4/165 dead transitions. [2022-12-06 05:40:48,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 165 transitions, 3272 flow [2022-12-06 05:40:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 05:40:48,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 05:40:48,290 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 2943 flow. Second operand 4 states and 52 transitions. [2022-12-06 05:40:48,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 165 transitions, 3272 flow [2022-12-06 05:40:48,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 165 transitions, 3105 flow, removed 69 selfloop flow, removed 5 redundant places. [2022-12-06 05:40:48,333 INFO L231 Difference]: Finished difference. Result has 120 places, 147 transitions, 2605 flow [2022-12-06 05:40:48,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2605, PETRI_PLACES=120, PETRI_TRANSITIONS=147} [2022-12-06 05:40:48,334 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 05:40:48,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:48,334 INFO L89 Accepts]: Start accepts. Operand has 120 places, 147 transitions, 2605 flow [2022-12-06 05:40:48,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:48,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:48,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 147 transitions, 2605 flow [2022-12-06 05:40:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 147 transitions, 2605 flow [2022-12-06 05:40:48,374 INFO L130 PetriNetUnfolder]: 120/414 cut-off events. [2022-12-06 05:40:48,374 INFO L131 PetriNetUnfolder]: For 7048/7160 co-relation queries the response was YES. [2022-12-06 05:40:48,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 414 events. 120/414 cut-off events. For 7048/7160 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2722 event pairs, 2 based on Foata normal form. 28/439 useless extension candidates. Maximal degree in co-relation 2581. Up to 149 conditions per place. [2022-12-06 05:40:48,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 147 transitions, 2605 flow [2022-12-06 05:40:48,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 05:40:48,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:48,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 05:40:48,379 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 147 transitions, 2605 flow [2022-12-06 05:40:48,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:48,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:48,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:48,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:48,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 05:40:48,584 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2081964557, now seen corresponding path program 1 times [2022-12-06 05:40:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:48,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864452985] [2022-12-06 05:40:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:49,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864452985] [2022-12-06 05:40:49,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864452985] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:49,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691892370] [2022-12-06 05:40:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:49,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:49,036 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:49,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 05:40:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:49,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 05:40:49,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:49,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:49,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:40:49,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:49,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 05:40:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:49,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:49,508 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-06 05:40:49,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 139 [2022-12-06 05:40:49,519 INFO L321 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2022-12-06 05:40:49,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 76 [2022-12-06 05:40:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:49,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691892370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:49,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:49,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:40:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061190946] [2022-12-06 05:40:49,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:49,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:40:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:49,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:40:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:40:49,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:40:49,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 147 transitions, 2605 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:49,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:49,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:40:49,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:50,130 INFO L130 PetriNetUnfolder]: 548/1080 cut-off events. [2022-12-06 05:40:50,131 INFO L131 PetriNetUnfolder]: For 24447/24520 co-relation queries the response was YES. [2022-12-06 05:40:50,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8869 conditions, 1080 events. 548/1080 cut-off events. For 24447/24520 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6213 event pairs, 157 based on Foata normal form. 22/1101 useless extension candidates. Maximal degree in co-relation 8039. Up to 846 conditions per place. [2022-12-06 05:40:50,136 INFO L137 encePairwiseOnDemand]: 9/29 looper letters, 137 selfloop transitions, 42 changer transitions 11/191 dead transitions. [2022-12-06 05:40:50,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 3407 flow [2022-12-06 05:40:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:40:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:40:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-12-06 05:40:50,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2827586206896552 [2022-12-06 05:40:50,142 INFO L175 Difference]: Start difference. First operand has 119 places, 147 transitions, 2605 flow. Second operand 10 states and 82 transitions. [2022-12-06 05:40:50,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 3407 flow [2022-12-06 05:40:50,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 191 transitions, 3398 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:50,183 INFO L231 Difference]: Finished difference. Result has 130 places, 155 transitions, 2874 flow [2022-12-06 05:40:50,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2600, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2874, PETRI_PLACES=130, PETRI_TRANSITIONS=155} [2022-12-06 05:40:50,184 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-06 05:40:50,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:50,184 INFO L89 Accepts]: Start accepts. Operand has 130 places, 155 transitions, 2874 flow [2022-12-06 05:40:50,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:50,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:50,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 155 transitions, 2874 flow [2022-12-06 05:40:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 155 transitions, 2874 flow [2022-12-06 05:40:50,229 INFO L130 PetriNetUnfolder]: 131/433 cut-off events. [2022-12-06 05:40:50,230 INFO L131 PetriNetUnfolder]: For 8123/8212 co-relation queries the response was YES. [2022-12-06 05:40:50,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 433 events. 131/433 cut-off events. For 8123/8212 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2830 event pairs, 2 based on Foata normal form. 21/451 useless extension candidates. Maximal degree in co-relation 3143. Up to 169 conditions per place. [2022-12-06 05:40:50,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 155 transitions, 2874 flow [2022-12-06 05:40:50,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 05:40:50,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:50,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:40:50,236 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 155 transitions, 2874 flow [2022-12-06 05:40:50,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:50,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:50,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:50,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 05:40:50,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:50,441 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 842933033, now seen corresponding path program 1 times [2022-12-06 05:40:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:50,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973374944] [2022-12-06 05:40:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:50,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:50,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973374944] [2022-12-06 05:40:50,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973374944] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:50,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627462772] [2022-12-06 05:40:50,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:50,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:50,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:50,636 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:50,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 05:40:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:50,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:40:50,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:50,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:40:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:50,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:50,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:50,956 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 42 [2022-12-06 05:40:50,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:40:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:50,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627462772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:50,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:50,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:40:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138596741] [2022-12-06 05:40:50,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:50,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:40:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:40:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=142, Unknown=3, NotChecked=0, Total=182 [2022-12-06 05:40:50,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:40:50,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 155 transitions, 2874 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:50,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:50,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:40:50,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:51,439 INFO L130 PetriNetUnfolder]: 539/1066 cut-off events. [2022-12-06 05:40:51,440 INFO L131 PetriNetUnfolder]: For 24944/25003 co-relation queries the response was YES. [2022-12-06 05:40:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9076 conditions, 1066 events. 539/1066 cut-off events. For 24944/25003 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6088 event pairs, 63 based on Foata normal form. 50/1116 useless extension candidates. Maximal degree in co-relation 8957. Up to 477 conditions per place. [2022-12-06 05:40:51,447 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 149 selfloop transitions, 45 changer transitions 0/195 dead transitions. [2022-12-06 05:40:51,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 195 transitions, 3635 flow [2022-12-06 05:40:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:40:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:40:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-06 05:40:51,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32567049808429116 [2022-12-06 05:40:51,448 INFO L175 Difference]: Start difference. First operand has 128 places, 155 transitions, 2874 flow. Second operand 9 states and 85 transitions. [2022-12-06 05:40:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 195 transitions, 3635 flow [2022-12-06 05:40:51,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 195 transitions, 3578 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 05:40:51,493 INFO L231 Difference]: Finished difference. Result has 132 places, 158 transitions, 2979 flow [2022-12-06 05:40:51,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=132, PETRI_TRANSITIONS=158} [2022-12-06 05:40:51,493 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 111 predicate places. [2022-12-06 05:40:51,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:51,493 INFO L89 Accepts]: Start accepts. Operand has 132 places, 158 transitions, 2979 flow [2022-12-06 05:40:51,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:51,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:51,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 158 transitions, 2979 flow [2022-12-06 05:40:51,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 158 transitions, 2979 flow [2022-12-06 05:40:51,540 INFO L130 PetriNetUnfolder]: 129/437 cut-off events. [2022-12-06 05:40:51,540 INFO L131 PetriNetUnfolder]: For 8828/8914 co-relation queries the response was YES. [2022-12-06 05:40:51,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 437 events. 129/437 cut-off events. For 8828/8914 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2912 event pairs, 2 based on Foata normal form. 17/451 useless extension candidates. Maximal degree in co-relation 3009. Up to 174 conditions per place. [2022-12-06 05:40:51,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 158 transitions, 2979 flow [2022-12-06 05:40:51,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 05:40:51,545 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:51,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:40:51,545 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 158 transitions, 2979 flow [2022-12-06 05:40:51,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:51,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:51,546 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:51,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:51,752 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1754713461, now seen corresponding path program 2 times [2022-12-06 05:40:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:51,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058522136] [2022-12-06 05:40:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058522136] [2022-12-06 05:40:51,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058522136] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575029805] [2022-12-06 05:40:51,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:40:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:51,823 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:51,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 05:40:51,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:40:51,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:40:51,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:40:51,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:51,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:40:52,064 INFO L321 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-12-06 05:40:52,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 28 [2022-12-06 05:40:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:40:52,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:40:52,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575029805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:52,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:40:52,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 05:40:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571795388] [2022-12-06 05:40:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:52,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:40:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:40:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:40:52,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:40:52,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 158 transitions, 2979 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:40:52,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:52,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:40:52,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:52,335 INFO L130 PetriNetUnfolder]: 364/757 cut-off events. [2022-12-06 05:40:52,336 INFO L131 PetriNetUnfolder]: For 20195/20295 co-relation queries the response was YES. [2022-12-06 05:40:52,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6393 conditions, 757 events. 364/757 cut-off events. For 20195/20295 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4043 event pairs, 116 based on Foata normal form. 101/858 useless extension candidates. Maximal degree in co-relation 5940. Up to 306 conditions per place. [2022-12-06 05:40:52,341 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 127 selfloop transitions, 11 changer transitions 21/160 dead transitions. [2022-12-06 05:40:52,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 3097 flow [2022-12-06 05:40:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 05:40:52,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42758620689655175 [2022-12-06 05:40:52,346 INFO L175 Difference]: Start difference. First operand has 132 places, 158 transitions, 2979 flow. Second operand 5 states and 62 transitions. [2022-12-06 05:40:52,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 3097 flow [2022-12-06 05:40:52,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 160 transitions, 2830 flow, removed 26 selfloop flow, removed 13 redundant places. [2022-12-06 05:40:52,384 INFO L231 Difference]: Finished difference. Result has 125 places, 113 transitions, 1891 flow [2022-12-06 05:40:52,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1891, PETRI_PLACES=125, PETRI_TRANSITIONS=113} [2022-12-06 05:40:52,385 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 104 predicate places. [2022-12-06 05:40:52,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:52,385 INFO L89 Accepts]: Start accepts. Operand has 125 places, 113 transitions, 1891 flow [2022-12-06 05:40:52,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:52,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:52,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 113 transitions, 1891 flow [2022-12-06 05:40:52,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 113 transitions, 1891 flow [2022-12-06 05:40:52,414 INFO L130 PetriNetUnfolder]: 74/288 cut-off events. [2022-12-06 05:40:52,414 INFO L131 PetriNetUnfolder]: For 5276/5323 co-relation queries the response was YES. [2022-12-06 05:40:52,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 288 events. 74/288 cut-off events. For 5276/5323 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1680 event pairs, 1 based on Foata normal form. 18/305 useless extension candidates. Maximal degree in co-relation 1700. Up to 95 conditions per place. [2022-12-06 05:40:52,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 113 transitions, 1891 flow [2022-12-06 05:40:52,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 05:40:52,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_392| v_~q~0.base_267)) (.cse1 (* v_~q_back~0_507 4))) (and (= v_~q_back~0_505 (+ 3 v_~q_back~0_507)) (not (= (ite (and (<= 1 v_~q_back~0_505) (< v_~q_back~0_505 (+ v_~n~0_278 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_223| (+ v_~N~0_196 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_64| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_223| v_~N~0_196)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_267)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_223| 2) (not (= (ite (and (< v_~q_back~0_507 v_~n~0_278) (<= 0 v_~q_back~0_507)) 1 0) 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_505 4) (- 4) v_~q~0.offset_267)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_267 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_64| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|))) InVars {~q_back~0=v_~q_back~0_507, #memory_int=|v_#memory_int_392|, ~N~0=v_~N~0_196, ~q~0.base=v_~q~0.base_267, ~n~0=v_~n~0_278, ~q~0.offset=v_~q~0.offset_267} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_64|, ~q_back~0=v_~q_back~0_505, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_82|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_147|, ~N~0=v_~N~0_196, ~q~0.base=v_~q~0.base_267, ~q~0.offset=v_~q~0.offset_267, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_151|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_147|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_223|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|, #memory_int=|v_#memory_int_392|, ~n~0=v_~n~0_278, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_64|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:40:52,601 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:52,601 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:52,686 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:52,686 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:52,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [622] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_380| v_~q~0.base_257))) (let ((.cse1 (select .cse0 (+ (* 4 v_~q_front~0_351) v_~q~0.offset_257)))) (and (not (= (ite (and (< v_~q_back~0_482 v_~n~0_268) (<= 0 v_~q_back~0_482)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_207| (+ |v_thread1Thread1of1ForFork0_~i~0#1_208| 1)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_482 4) v_~q~0.offset_257)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|) (= (+ .cse1 v_~s~0_277 |v_thread2Thread1of1ForFork1_~j~0#1_163|) v_~s~0_275) (< |v_thread1Thread1of1ForFork0_~i~0#1_208| v_~N~0_186) (= (+ 2 v_~q_front~0_351) v_~q_front~0_349) (not (= (ite (and (< v_~q_front~0_351 v_~q_back~0_482) (< v_~q_front~0_351 v_~n~0_268) (<= 0 v_~q_front~0_351)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| (ite (and (< v_~q_front~0_349 (+ v_~q_back~0_481 1)) (<= 1 v_~q_front~0_349) (< v_~q_front~0_349 (+ v_~n~0_268 1))) 1 0)) (= v_~q_back~0_481 (+ v_~q_back~0_482 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|) (not (= .cse1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_163| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|) (= |v_thread2Thread1of1ForFork1_~j~0#1_163| (select .cse0 (+ (* 4 v_~q_front~0_349) (- 4) v_~q~0.offset_257)))))) InVars {~q_back~0=v_~q_back~0_482, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_208|, #memory_int=|v_#memory_int_380|, ~N~0=v_~N~0_186, ~q~0.base=v_~q~0.base_257, ~n~0=v_~n~0_268, ~q~0.offset=v_~q~0.offset_257, ~s~0=v_~s~0_277, ~q_front~0=v_~q_front~0_351} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_163|, ~q_back~0=v_~q_back~0_481, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_146|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_135|, ~N~0=v_~N~0_186, ~q~0.base=v_~q~0.base_257, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_146|, ~q~0.offset=v_~q~0.offset_257, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_139|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_135|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_207|, #memory_int=|v_#memory_int_380|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|, ~n~0=v_~n~0_268, ~s~0=v_~s~0_275, ~q_front~0=v_~q_front~0_349} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:40:53,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-2-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_430| v_~q~0.base_291))) (let ((.cse1 (select .cse2 (+ (* 4 v_~q_front~0_437) v_~q~0.offset_291))) (.cse0 (+ v_~n~0_302 1))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_227| 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 1) v_~N~0_214) (not (= 0 (ite (and (<= 1 v_~q_back~0_567) (< v_~q_back~0_567 .cse0)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|) (not (= .cse1 0)) (= (+ 2 v_~q_front~0_437) v_~q_front~0_436) (= (ite (= (select .cse2 (+ (* v_~q_back~0_567 4) (- 4) v_~q~0.offset_291)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244|) (= (+ 2 v_~q_back~0_569) v_~q_back~0_567) (= |v_thread1Thread1of1ForFork0_~i~0#1_259| (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 2)) (not (= 0 (ite (and (< v_~q_front~0_437 v_~q_back~0_569) (<= 0 v_~q_front~0_437) (< v_~q_front~0_437 v_~n~0_302)) 1 0))) (= (select .cse2 (+ (- 4) v_~q~0.offset_291 (* 4 v_~q_front~0_436))) |v_thread2Thread1of1ForFork1_~j~0#1_227|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_244|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_244| 0)) (= (+ .cse1 v_~s~0_362 |v_thread2Thread1of1ForFork1_~j~0#1_227|) v_~s~0_361) (not (= (ite (= (select .cse2 (+ (* v_~q_back~0_569 4) v_~q~0.offset_291)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205| (ite (and (<= 1 v_~q_front~0_436) (< v_~q_front~0_436 v_~q_back~0_567) (< v_~q_front~0_436 .cse0)) 1 0))))) InVars {~q_back~0=v_~q_back~0_569, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, #memory_int=|v_#memory_int_430|, ~N~0=v_~N~0_214, ~q~0.base=v_~q~0.base_291, ~n~0=v_~n~0_302, ~q~0.offset=v_~q~0.offset_291, ~s~0=v_~s~0_362, ~q_front~0=v_~q_front~0_437} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_227|, ~q_back~0=v_~q_back~0_567, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_205|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_175|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_205|, ~N~0=v_~N~0_214, ~q~0.base=v_~q~0.base_291, ~q~0.offset=v_~q~0.offset_291, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_205|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_179|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_175|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_259|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_244|, #memory_int=|v_#memory_int_430|, ~n~0=v_~n~0_302, ~s~0=v_~s~0_361, ~q_front~0=v_~q_front~0_436} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:53,444 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:53,444 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:53,444 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:53,444 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:53,444 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:53,444 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:53,787 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:40:53,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1403 [2022-12-06 05:40:53,788 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 1915 flow [2022-12-06 05:40:53,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:40:53,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:53,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:53,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:53,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:53,989 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 545248297, now seen corresponding path program 1 times [2022-12-06 05:40:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:53,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513528476] [2022-12-06 05:40:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:54,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513528476] [2022-12-06 05:40:54,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513528476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:54,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:54,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421317712] [2022-12-06 05:40:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:54,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:54,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:54,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:40:54,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 1915 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:54,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:54,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:40:54,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:54,514 INFO L130 PetriNetUnfolder]: 337/688 cut-off events. [2022-12-06 05:40:54,514 INFO L131 PetriNetUnfolder]: For 15859/15883 co-relation queries the response was YES. [2022-12-06 05:40:54,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5545 conditions, 688 events. 337/688 cut-off events. For 15859/15883 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3560 event pairs, 86 based on Foata normal form. 26/714 useless extension candidates. Maximal degree in co-relation 4812. Up to 593 conditions per place. [2022-12-06 05:40:54,517 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 100 selfloop transitions, 25 changer transitions 0/126 dead transitions. [2022-12-06 05:40:54,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 126 transitions, 2335 flow [2022-12-06 05:40:54,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 05:40:54,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33793103448275863 [2022-12-06 05:40:54,518 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 1915 flow. Second operand 5 states and 49 transitions. [2022-12-06 05:40:54,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 126 transitions, 2335 flow [2022-12-06 05:40:54,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 126 transitions, 2111 flow, removed 73 selfloop flow, removed 15 redundant places. [2022-12-06 05:40:54,540 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 1855 flow [2022-12-06 05:40:54,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1855, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2022-12-06 05:40:54,541 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:40:54,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:54,541 INFO L89 Accepts]: Start accepts. Operand has 109 places, 114 transitions, 1855 flow [2022-12-06 05:40:54,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:54,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:54,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 114 transitions, 1855 flow [2022-12-06 05:40:54,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 114 transitions, 1855 flow [2022-12-06 05:40:54,568 INFO L130 PetriNetUnfolder]: 82/303 cut-off events. [2022-12-06 05:40:54,568 INFO L131 PetriNetUnfolder]: For 3905/3970 co-relation queries the response was YES. [2022-12-06 05:40:54,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 303 events. 82/303 cut-off events. For 3905/3970 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1809 event pairs, 1 based on Foata normal form. 30/332 useless extension candidates. Maximal degree in co-relation 1699. Up to 103 conditions per place. [2022-12-06 05:40:54,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 114 transitions, 1855 flow [2022-12-06 05:40:54,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 05:40:54,571 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:54,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:40:54,571 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 114 transitions, 1855 flow [2022-12-06 05:40:54,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:54,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:54,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 05:40:54,571 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -978574720, now seen corresponding path program 1 times [2022-12-06 05:40:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:54,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942956142] [2022-12-06 05:40:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:54,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942956142] [2022-12-06 05:40:54,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942956142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:54,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:54,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:40:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878632097] [2022-12-06 05:40:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:54,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:54,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:54,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:40:54,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:40:54,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 114 transitions, 1855 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:54,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:54,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:40:54,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:54,752 INFO L130 PetriNetUnfolder]: 335/690 cut-off events. [2022-12-06 05:40:54,752 INFO L131 PetriNetUnfolder]: For 11714/11714 co-relation queries the response was YES. [2022-12-06 05:40:54,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 690 events. 335/690 cut-off events. For 11714/11714 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3595 event pairs, 128 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 4412. Up to 349 conditions per place. [2022-12-06 05:40:54,755 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 120 selfloop transitions, 6 changer transitions 0/127 dead transitions. [2022-12-06 05:40:54,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 127 transitions, 2195 flow [2022-12-06 05:40:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 05:40:54,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2022-12-06 05:40:54,756 INFO L175 Difference]: Start difference. First operand has 109 places, 114 transitions, 1855 flow. Second operand 4 states and 46 transitions. [2022-12-06 05:40:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 127 transitions, 2195 flow [2022-12-06 05:40:54,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 2175 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:40:54,772 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 1818 flow [2022-12-06 05:40:54,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1818, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2022-12-06 05:40:54,772 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 90 predicate places. [2022-12-06 05:40:54,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:54,772 INFO L89 Accepts]: Start accepts. Operand has 111 places, 113 transitions, 1818 flow [2022-12-06 05:40:54,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:54,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:54,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 113 transitions, 1818 flow [2022-12-06 05:40:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 113 transitions, 1818 flow [2022-12-06 05:40:54,806 INFO L130 PetriNetUnfolder]: 81/305 cut-off events. [2022-12-06 05:40:54,807 INFO L131 PetriNetUnfolder]: For 3903/3939 co-relation queries the response was YES. [2022-12-06 05:40:54,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 305 events. 81/305 cut-off events. For 3903/3939 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1834 event pairs, 1 based on Foata normal form. 22/327 useless extension candidates. Maximal degree in co-relation 1673. Up to 102 conditions per place. [2022-12-06 05:40:54,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 113 transitions, 1818 flow [2022-12-06 05:40:54,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 05:40:54,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:55,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:55,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:55,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-06 05:40:55,191 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 1850 flow [2022-12-06 05:40:55,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:55,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:55,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:55,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 05:40:55,192 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1456395772, now seen corresponding path program 1 times [2022-12-06 05:40:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207096781] [2022-12-06 05:40:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207096781] [2022-12-06 05:40:55,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207096781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820160062] [2022-12-06 05:40:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:55,464 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:55,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 05:40:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:55,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 05:40:55,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:55,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:55,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:40:55,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:55,664 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 12 [2022-12-06 05:40:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:55,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:55,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:55,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 136 [2022-12-06 05:40:55,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:55,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 62 [2022-12-06 05:40:55,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:40:55,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 49 [2022-12-06 05:40:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:55,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820160062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:55,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:55,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:40:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176282154] [2022-12-06 05:40:55,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:55,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:40:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:40:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:40:55,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:40:55,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 1850 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:55,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:55,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:40:55,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:56,233 INFO L130 PetriNetUnfolder]: 343/715 cut-off events. [2022-12-06 05:40:56,233 INFO L131 PetriNetUnfolder]: For 12279/12300 co-relation queries the response was YES. [2022-12-06 05:40:56,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 715 events. 343/715 cut-off events. For 12279/12300 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3825 event pairs, 83 based on Foata normal form. 18/733 useless extension candidates. Maximal degree in co-relation 4664. Up to 608 conditions per place. [2022-12-06 05:40:56,237 INFO L137 encePairwiseOnDemand]: 11/30 looper letters, 106 selfloop transitions, 29 changer transitions 3/139 dead transitions. [2022-12-06 05:40:56,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 139 transitions, 2305 flow [2022-12-06 05:40:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:40:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:40:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-06 05:40:56,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 05:40:56,256 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 1850 flow. Second operand 8 states and 75 transitions. [2022-12-06 05:40:56,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 139 transitions, 2305 flow [2022-12-06 05:40:56,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 2298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:40:56,273 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 1937 flow [2022-12-06 05:40:56,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1937, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2022-12-06 05:40:56,274 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2022-12-06 05:40:56,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:56,274 INFO L89 Accepts]: Start accepts. Operand has 118 places, 114 transitions, 1937 flow [2022-12-06 05:40:56,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:56,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:56,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 114 transitions, 1937 flow [2022-12-06 05:40:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 114 transitions, 1937 flow [2022-12-06 05:40:56,302 INFO L130 PetriNetUnfolder]: 81/313 cut-off events. [2022-12-06 05:40:56,302 INFO L131 PetriNetUnfolder]: For 4308/4369 co-relation queries the response was YES. [2022-12-06 05:40:56,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 313 events. 81/313 cut-off events. For 4308/4369 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1949 event pairs, 1 based on Foata normal form. 29/342 useless extension candidates. Maximal degree in co-relation 1800. Up to 107 conditions per place. [2022-12-06 05:40:56,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 114 transitions, 1937 flow [2022-12-06 05:40:56,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 05:40:56,309 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,309 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:56,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:40:56,440 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 1927 flow [2022-12-06 05:40:56,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:56,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:56,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:56,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:56,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-06 05:40:56,646 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash 689373885, now seen corresponding path program 1 times [2022-12-06 05:40:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:56,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037517636] [2022-12-06 05:40:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:56,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:56,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037517636] [2022-12-06 05:40:56,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037517636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:56,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:56,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529908907] [2022-12-06 05:40:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:56,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:40:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:40:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:40:56,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:40:56,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 1927 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:56,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:56,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:40:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:56,905 INFO L130 PetriNetUnfolder]: 268/562 cut-off events. [2022-12-06 05:40:56,906 INFO L131 PetriNetUnfolder]: For 10807/10851 co-relation queries the response was YES. [2022-12-06 05:40:56,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 562 events. 268/562 cut-off events. For 10807/10851 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2817 event pairs, 103 based on Foata normal form. 18/580 useless extension candidates. Maximal degree in co-relation 4132. Up to 349 conditions per place. [2022-12-06 05:40:56,908 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 109 selfloop transitions, 5 changer transitions 3/118 dead transitions. [2022-12-06 05:40:56,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 2075 flow [2022-12-06 05:40:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:40:56,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:40:56,909 INFO L175 Difference]: Start difference. First operand has 116 places, 113 transitions, 1927 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:40:56,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 2075 flow [2022-12-06 05:40:56,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 118 transitions, 1987 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 05:40:56,925 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 1559 flow [2022-12-06 05:40:56,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1559, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-12-06 05:40:56,926 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 05:40:56,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:56,926 INFO L89 Accepts]: Start accepts. Operand has 113 places, 97 transitions, 1559 flow [2022-12-06 05:40:56,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:56,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:56,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 97 transitions, 1559 flow [2022-12-06 05:40:56,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 97 transitions, 1559 flow [2022-12-06 05:40:56,947 INFO L130 PetriNetUnfolder]: 63/246 cut-off events. [2022-12-06 05:40:56,947 INFO L131 PetriNetUnfolder]: For 3181/3239 co-relation queries the response was YES. [2022-12-06 05:40:56,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 246 events. 63/246 cut-off events. For 3181/3239 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1396 event pairs, 1 based on Foata normal form. 26/272 useless extension candidates. Maximal degree in co-relation 1443. Up to 74 conditions per place. [2022-12-06 05:40:56,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 97 transitions, 1559 flow [2022-12-06 05:40:56,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:40:56,950 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,950 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,950 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,950 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,950 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:56,950 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:57,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:40:57,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 377 [2022-12-06 05:40:57,303 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 1586 flow [2022-12-06 05:40:57,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:57,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:57,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:57,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 05:40:57,303 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -33509372, now seen corresponding path program 1 times [2022-12-06 05:40:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:57,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767045543] [2022-12-06 05:40:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:57,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767045543] [2022-12-06 05:40:57,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767045543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490958180] [2022-12-06 05:40:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:57,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:57,386 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:57,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 05:40:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:57,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:40:57,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:57,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:40:57,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490958180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:57,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:40:57,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:40:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014338980] [2022-12-06 05:40:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:57,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:40:57,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:40:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:40:57,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:40:57,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 1586 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:57,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:57,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:40:57,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:57,625 INFO L130 PetriNetUnfolder]: 259/541 cut-off events. [2022-12-06 05:40:57,625 INFO L131 PetriNetUnfolder]: For 9962/10037 co-relation queries the response was YES. [2022-12-06 05:40:57,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3950 conditions, 541 events. 259/541 cut-off events. For 9962/10037 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2680 event pairs, 98 based on Foata normal form. 23/564 useless extension candidates. Maximal degree in co-relation 3861. Up to 349 conditions per place. [2022-12-06 05:40:57,628 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 101 selfloop transitions, 1 changer transitions 5/108 dead transitions. [2022-12-06 05:40:57,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1860 flow [2022-12-06 05:40:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:40:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:40:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 05:40:57,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-06 05:40:57,629 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 1586 flow. Second operand 4 states and 45 transitions. [2022-12-06 05:40:57,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1860 flow [2022-12-06 05:40:57,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 1794 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 05:40:57,642 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 1476 flow [2022-12-06 05:40:57,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1476, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2022-12-06 05:40:57,642 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:40:57,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:57,643 INFO L89 Accepts]: Start accepts. Operand has 109 places, 95 transitions, 1476 flow [2022-12-06 05:40:57,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:57,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:57,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 95 transitions, 1476 flow [2022-12-06 05:40:57,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 95 transitions, 1476 flow [2022-12-06 05:40:57,663 INFO L130 PetriNetUnfolder]: 62/235 cut-off events. [2022-12-06 05:40:57,663 INFO L131 PetriNetUnfolder]: For 3237/3316 co-relation queries the response was YES. [2022-12-06 05:40:57,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 235 events. 62/235 cut-off events. For 3237/3316 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1314 event pairs, 1 based on Foata normal form. 33/268 useless extension candidates. Maximal degree in co-relation 1231. Up to 56 conditions per place. [2022-12-06 05:40:57,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 95 transitions, 1476 flow [2022-12-06 05:40:57,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 05:40:57,665 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:57,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:40:57,666 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 95 transitions, 1476 flow [2022-12-06 05:40:57,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:57,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:57,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:57,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:57,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:57,871 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash -51900758, now seen corresponding path program 1 times [2022-12-06 05:40:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:57,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254493605] [2022-12-06 05:40:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:57,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254493605] [2022-12-06 05:40:58,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254493605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:58,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:58,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:40:58,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100007143] [2022-12-06 05:40:58,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:58,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:40:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:40:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:40:58,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 05:40:58,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 95 transitions, 1476 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:58,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:58,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 05:40:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:58,324 INFO L130 PetriNetUnfolder]: 262/542 cut-off events. [2022-12-06 05:40:58,324 INFO L131 PetriNetUnfolder]: For 9439/9481 co-relation queries the response was YES. [2022-12-06 05:40:58,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 542 events. 262/542 cut-off events. For 9439/9481 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2645 event pairs, 94 based on Foata normal form. 13/555 useless extension candidates. Maximal degree in co-relation 3235. Up to 508 conditions per place. [2022-12-06 05:40:58,327 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 95 selfloop transitions, 8 changer transitions 2/106 dead transitions. [2022-12-06 05:40:58,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 1734 flow [2022-12-06 05:40:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:40:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:40:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 05:40:58,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 05:40:58,327 INFO L175 Difference]: Start difference. First operand has 106 places, 95 transitions, 1476 flow. Second operand 5 states and 42 transitions. [2022-12-06 05:40:58,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 1734 flow [2022-12-06 05:40:58,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 1718 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:40:58,340 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 1501 flow [2022-12-06 05:40:58,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1501, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2022-12-06 05:40:58,340 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 05:40:58,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:58,340 INFO L89 Accepts]: Start accepts. Operand has 109 places, 97 transitions, 1501 flow [2022-12-06 05:40:58,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:58,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:58,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 97 transitions, 1501 flow [2022-12-06 05:40:58,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 97 transitions, 1501 flow [2022-12-06 05:40:58,361 INFO L130 PetriNetUnfolder]: 62/240 cut-off events. [2022-12-06 05:40:58,361 INFO L131 PetriNetUnfolder]: For 3029/3083 co-relation queries the response was YES. [2022-12-06 05:40:58,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 240 events. 62/240 cut-off events. For 3029/3083 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1353 event pairs, 1 based on Foata normal form. 26/266 useless extension candidates. Maximal degree in co-relation 1310. Up to 56 conditions per place. [2022-12-06 05:40:58,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 97 transitions, 1501 flow [2022-12-06 05:40:58,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:40:58,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:40:58,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_444| v_~q~0.base_303)) (.cse2 (* v_~q_back~0_596 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_279| (+ v_~N~0_224 1)) (not (= (ite (let ((.cse0 (+ v_~q_back~0_596 1))) (and (< .cse0 v_~n~0_314) (<= 0 .cse0))) 1 0) 0)) (= (select .cse1 (+ (- 4) v_~q~0.offset_303 (* 4 v_~q_front~0_466))) |v_thread2Thread1of1ForFork1_~j~0#1_247|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_247| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_224| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260| 0)) (= (+ 2 v_~q_front~0_468) v_~q_front~0_466) (= v_~s~0_393 (+ (select .cse1 (+ (* 4 v_~q_front~0_468) v_~q~0.offset_303)) v_~s~0_395 |v_thread2Thread1of1ForFork1_~j~0#1_247|)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_303 .cse2)) 1) 1 0) 0)) (= v_~q_back~0_595 (+ 2 v_~q_back~0_596)) (not (= (ite (and (< v_~q_front~0_468 v_~q_back~0_595) (< v_~q_front~0_468 v_~n~0_314) (<= 0 v_~q_front~0_468)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_279| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_260| (ite (= (select .cse1 (+ v_~q~0.offset_303 4 .cse2)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_260| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_224| (ite (and (< v_~q_front~0_466 (+ v_~q_back~0_595 1)) (< v_~q_front~0_466 (+ v_~n~0_314 1)) (<= 1 v_~q_front~0_466)) 1 0)) (not (= (+ v_~s~0_395 |v_thread2Thread1of1ForFork1_~j~0#1_247|) v_~s~0_393)))) InVars {~q_back~0=v_~q_back~0_596, #memory_int=|v_#memory_int_444|, ~N~0=v_~N~0_224, ~q~0.base=v_~q~0.base_303, ~n~0=v_~n~0_314, ~q~0.offset=v_~q~0.offset_303, ~s~0=v_~s~0_395, ~q_front~0=v_~q_front~0_468} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_247|, ~q_back~0=v_~q_back~0_595, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_224|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_224|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_185|, ~N~0=v_~N~0_224, ~q~0.base=v_~q~0.base_303, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_224|, ~q~0.offset=v_~q~0.offset_303, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_224|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_260|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_189|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_185|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_279|, #memory_int=|v_#memory_int_444|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|, ~n~0=v_~n~0_314, ~s~0=v_~s~0_393, ~q_front~0=v_~q_front~0_466} 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, ~s~0, ~q_front~0] and [656] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_446| v_~q~0.base_305))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|) (= (select .cse0 (+ v_~q~0.offset_305 (* 4 v_~q_front~0_475))) |v_thread2Thread1of1ForFork1_~j~0#1_251|) (= (+ 1 v_~q_front~0_475) v_~q_front~0_474) (= (+ v_~s~0_400 |v_thread2Thread1of1ForFork1_~j~0#1_251|) v_~s~0_399) (= |v_thread1Thread1of1ForFork0_#res#1.offset_98| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_228| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| (ite (= (select .cse0 (+ (* v_~q_back~0_600 4) v_~q~0.offset_305)) 0) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_251| 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_281| v_~N~0_226)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_228|) (= (ite (and (< v_~q_front~0_475 v_~q_back~0_599) (< v_~q_front~0_475 v_~n~0_316) (<= 0 v_~q_front~0_475)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262| 0)) (not (= (ite (and (< v_~q_back~0_600 v_~n~0_316) (<= 0 v_~q_back~0_600)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_98| 0) (= v_~q_back~0_599 (+ v_~q_back~0_600 1)))) InVars {~q_back~0=v_~q_back~0_600, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_281|, #memory_int=|v_#memory_int_446|, ~N~0=v_~N~0_226, ~q~0.base=v_~q~0.base_305, ~n~0=v_~n~0_316, ~q~0.offset=v_~q~0.offset_305, ~s~0=v_~s~0_400, ~q_front~0=v_~q_front~0_475} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_251|, ~q_back~0=v_~q_back~0_599, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_98|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_116|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_228|, ~N~0=v_~N~0_226, ~q~0.base=v_~q~0.base_305, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_228|, ~q~0.offset=v_~q~0.offset_305, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_281|, #memory_int=|v_#memory_int_446|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_116|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|, ~n~0=v_~n~0_316, ~s~0=v_~s~0_399, ~q_front~0=v_~q_front~0_474, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_98|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#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~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:40:58,530 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:58,530 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:59,095 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:59,096 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:40:59,425 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:40:59,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1086 [2022-12-06 05:40:59,426 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 96 transitions, 1547 flow [2022-12-06 05:40:59,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:59,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:59,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:59,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 05:40:59,426 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:40:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 147710832, now seen corresponding path program 1 times [2022-12-06 05:40:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:59,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597544646] [2022-12-06 05:40:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597544646] [2022-12-06 05:40:59,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597544646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209680605] [2022-12-06 05:40:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:59,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:59,767 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:40:59,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 05:40:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:59,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-06 05:40:59,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:59,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:59,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:59,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 05:40:59,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:40:59,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:40:59,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:41:00,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:00,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-12-06 05:41:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:00,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209680605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:00,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:41:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3395121] [2022-12-06 05:41:00,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:00,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:41:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:41:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=139, Unknown=2, NotChecked=0, Total=182 [2022-12-06 05:41:00,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:41:00,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 96 transitions, 1547 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:00,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:00,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:41:00,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:00,602 INFO L130 PetriNetUnfolder]: 258/538 cut-off events. [2022-12-06 05:41:00,602 INFO L131 PetriNetUnfolder]: For 9471/9502 co-relation queries the response was YES. [2022-12-06 05:41:00,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 538 events. 258/538 cut-off events. For 9471/9502 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2616 event pairs, 73 based on Foata normal form. 13/551 useless extension candidates. Maximal degree in co-relation 3651. Up to 471 conditions per place. [2022-12-06 05:41:00,605 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 85 selfloop transitions, 24 changer transitions 6/116 dead transitions. [2022-12-06 05:41:00,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 1841 flow [2022-12-06 05:41:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:41:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:41:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-12-06 05:41:00,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3173076923076923 [2022-12-06 05:41:00,606 INFO L175 Difference]: Start difference. First operand has 108 places, 96 transitions, 1547 flow. Second operand 8 states and 66 transitions. [2022-12-06 05:41:00,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 1841 flow [2022-12-06 05:41:00,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 1820 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 05:41:00,618 INFO L231 Difference]: Finished difference. Result has 113 places, 95 transitions, 1475 flow [2022-12-06 05:41:00,619 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1475, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2022-12-06 05:41:00,619 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 05:41:00,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:00,619 INFO L89 Accepts]: Start accepts. Operand has 113 places, 95 transitions, 1475 flow [2022-12-06 05:41:00,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:00,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:00,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 95 transitions, 1475 flow [2022-12-06 05:41:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 95 transitions, 1475 flow [2022-12-06 05:41:00,641 INFO L130 PetriNetUnfolder]: 67/252 cut-off events. [2022-12-06 05:41:00,641 INFO L131 PetriNetUnfolder]: For 3939/4011 co-relation queries the response was YES. [2022-12-06 05:41:00,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 252 events. 67/252 cut-off events. For 3939/4011 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1437 event pairs, 3 based on Foata normal form. 30/281 useless extension candidates. Maximal degree in co-relation 1477. Up to 65 conditions per place. [2022-12-06 05:41:00,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 95 transitions, 1475 flow [2022-12-06 05:41:00,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 05:41:00,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:00,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_426| v_~q~0.base_287))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_287 (* 4 v_~q_front~0_426))))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_219| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197| (ite (and (<= 1 v_~q_front~0_424) (< v_~q_front~0_424 (+ v_~q_back~0_563 1)) (< v_~q_front~0_424 (+ v_~n~0_298 1))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (= (+ .cse0 v_~s~0_351 |v_thread2Thread1of1ForFork1_~j~0#1_219|) v_~s~0_349) (= (+ 2 v_~q_front~0_426) v_~q_front~0_424) (= (select .cse1 (+ (- 4) (* 4 v_~q_front~0_424) v_~q~0.offset_287)) |v_thread2Thread1of1ForFork1_~j~0#1_219|) (not (= .cse0 0)) (not (= (ite (and (< v_~q_front~0_426 v_~n~0_298) (<= 0 v_~q_front~0_426) (< v_~q_front~0_426 v_~q_back~0_563)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_563, #memory_int=|v_#memory_int_426|, ~q~0.base=v_~q~0.base_287, ~n~0=v_~n~0_298, ~q~0.offset=v_~q~0.offset_287, ~s~0=v_~s~0_351, ~q_front~0=v_~q_front~0_426} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_219|, ~q_back~0=v_~q_back~0_563, #memory_int=|v_#memory_int_426|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_197|, ~q~0.base=v_~q~0.base_287, ~n~0=v_~n~0_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_197|, ~q~0.offset=v_~q~0.offset_287, ~s~0=v_~s~0_349, ~q_front~0=v_~q_front~0_424} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:00,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:00,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-06 05:41:00,893 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 1538 flow [2022-12-06 05:41:00,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:00,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:00,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:00,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 05:41:01,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:01,099 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1535768899, now seen corresponding path program 2 times [2022-12-06 05:41:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:01,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679705256] [2022-12-06 05:41:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:01,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:01,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679705256] [2022-12-06 05:41:01,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679705256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:01,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:01,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:41:01,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867101688] [2022-12-06 05:41:01,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:01,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:41:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:41:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:41:01,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:41:01,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 1538 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 05:41:01,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:01,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:41:01,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:01,565 INFO L130 PetriNetUnfolder]: 270/563 cut-off events. [2022-12-06 05:41:01,566 INFO L131 PetriNetUnfolder]: For 9466/9492 co-relation queries the response was YES. [2022-12-06 05:41:01,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 563 events. 270/563 cut-off events. For 9466/9492 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2761 event pairs, 60 based on Foata normal form. 11/574 useless extension candidates. Maximal degree in co-relation 3932. Up to 399 conditions per place. [2022-12-06 05:41:01,568 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 81 selfloop transitions, 28 changer transitions 0/110 dead transitions. [2022-12-06 05:41:01,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 1852 flow [2022-12-06 05:41:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:41:01,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.352 [2022-12-06 05:41:01,569 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 1538 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:41:01,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 1852 flow [2022-12-06 05:41:01,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 1762 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-06 05:41:01,582 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 1542 flow [2022-12-06 05:41:01,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1542, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2022-12-06 05:41:01,582 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:41:01,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:01,582 INFO L89 Accepts]: Start accepts. Operand has 110 places, 98 transitions, 1542 flow [2022-12-06 05:41:01,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:01,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:01,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 98 transitions, 1542 flow [2022-12-06 05:41:01,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 98 transitions, 1542 flow [2022-12-06 05:41:01,606 INFO L130 PetriNetUnfolder]: 69/265 cut-off events. [2022-12-06 05:41:01,606 INFO L131 PetriNetUnfolder]: For 4449/4530 co-relation queries the response was YES. [2022-12-06 05:41:01,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 265 events. 69/265 cut-off events. For 4449/4530 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1545 event pairs, 6 based on Foata normal form. 34/298 useless extension candidates. Maximal degree in co-relation 1532. Up to 66 conditions per place. [2022-12-06 05:41:01,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 98 transitions, 1542 flow [2022-12-06 05:41:01,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:41:01,609 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:01,609 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:01,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:01,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 05:41:01,720 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 1563 flow [2022-12-06 05:41:01,720 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 05:41:01,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:01,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:01,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 05:41:01,720 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 743211732, now seen corresponding path program 1 times [2022-12-06 05:41:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:01,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879931677] [2022-12-06 05:41:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:02,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879931677] [2022-12-06 05:41:02,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879931677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:02,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715510096] [2022-12-06 05:41:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:02,051 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:02,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 05:41:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:02,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:41:02,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:02,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:02,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:02,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:02,244 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 46 treesize of output 12 [2022-12-06 05:41:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:02,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:02,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:02,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 157 [2022-12-06 05:41:02,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:02,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 94 [2022-12-06 05:41:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:02,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715510096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:02,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:02,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:41:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138014424] [2022-12-06 05:41:02,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:02,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:41:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:41:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:41:02,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:41:02,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 1563 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:02,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:02,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:41:02,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:03,112 INFO L130 PetriNetUnfolder]: 285/601 cut-off events. [2022-12-06 05:41:03,112 INFO L131 PetriNetUnfolder]: For 9693/9710 co-relation queries the response was YES. [2022-12-06 05:41:03,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 601 events. 285/601 cut-off events. For 9693/9710 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3076 event pairs, 49 based on Foata normal form. 18/615 useless extension candidates. Maximal degree in co-relation 4286. Up to 479 conditions per place. [2022-12-06 05:41:03,116 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 102 selfloop transitions, 28 changer transitions 6/137 dead transitions. [2022-12-06 05:41:03,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 137 transitions, 2069 flow [2022-12-06 05:41:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:41:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:41:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-12-06 05:41:03,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27384615384615385 [2022-12-06 05:41:03,118 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 1563 flow. Second operand 13 states and 89 transitions. [2022-12-06 05:41:03,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 137 transitions, 2069 flow [2022-12-06 05:41:03,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 2031 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:03,143 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 1668 flow [2022-12-06 05:41:03,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1668, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2022-12-06 05:41:03,144 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 05:41:03,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:03,144 INFO L89 Accepts]: Start accepts. Operand has 124 places, 102 transitions, 1668 flow [2022-12-06 05:41:03,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:03,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:03,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 102 transitions, 1668 flow [2022-12-06 05:41:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 102 transitions, 1668 flow [2022-12-06 05:41:03,171 INFO L130 PetriNetUnfolder]: 71/280 cut-off events. [2022-12-06 05:41:03,172 INFO L131 PetriNetUnfolder]: For 4764/4834 co-relation queries the response was YES. [2022-12-06 05:41:03,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 280 events. 71/280 cut-off events. For 4764/4834 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1663 event pairs, 8 based on Foata normal form. 29/307 useless extension candidates. Maximal degree in co-relation 1718. Up to 70 conditions per place. [2022-12-06 05:41:03,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 102 transitions, 1668 flow [2022-12-06 05:41:03,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 05:41:03,203 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:03,204 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L65-2-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_455| v_~q~0.base_311))) (and (= v_~q_front~0_493 (+ 1 v_~q_front~0_494)) (not (= 0 (ite (and (< v_~q_back~0_617 v_~n~0_322) (<= 0 v_~q_back~0_617)) 1 0))) (= (select .cse0 (+ (* 4 v_~q_front~0_494) v_~q~0.offset_311)) |v_thread2Thread1of1ForFork1_~j~0#1_265|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_617 4) v_~q~0.offset_311)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_104| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_289| v_~N~0_232)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_241| 0)) (= v_~q_back~0_616 (+ v_~q_back~0_617 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_104| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_265| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|) (= (+ v_~s~0_420 |v_thread2Thread1of1ForFork1_~j~0#1_265|) v_~s~0_419) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| (ite (and (<= 0 v_~q_front~0_494) (< v_~q_front~0_494 v_~n~0_322) (< v_~q_front~0_494 v_~q_back~0_617)) 1 0)))) InVars {~q_back~0=v_~q_back~0_617, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, #memory_int=|v_#memory_int_455|, ~N~0=v_~N~0_232, ~q~0.base=v_~q~0.base_311, ~n~0=v_~n~0_322, ~q~0.offset=v_~q~0.offset_311, ~s~0=v_~s~0_420, ~q_front~0=v_~q_front~0_494} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_265|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_104|, ~q_back~0=v_~q_back~0_616, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_241|, ~N~0=v_~N~0_232, ~q~0.base=v_~q~0.base_311, ~q~0.offset=v_~q~0.offset_311, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_241|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_122|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|, #memory_int=|v_#memory_int_455|, ~n~0=v_~n~0_322, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_104|, ~s~0=v_~s~0_419, ~q_front~0=v_~q_front~0_493} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#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~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:04,753 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,753 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,753 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,753 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,754 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,754 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:04,925 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:04,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1782 [2022-12-06 05:41:04,926 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 101 transitions, 1689 flow [2022-12-06 05:41:04,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:04,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:04,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:04,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:05,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:05,132 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash 835926819, now seen corresponding path program 1 times [2022-12-06 05:41:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:05,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255101043] [2022-12-06 05:41:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:05,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255101043] [2022-12-06 05:41:05,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255101043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:05,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090980644] [2022-12-06 05:41:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:05,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:05,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:05,203 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:05,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 05:41:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:05,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:41:05,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:05,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:41:05,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090980644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:05,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:41:05,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:41:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166253003] [2022-12-06 05:41:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:05,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:41:05,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:41:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:41:05,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 05:41:05,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 101 transitions, 1689 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:05,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:05,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 05:41:05,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:05,459 INFO L130 PetriNetUnfolder]: 267/560 cut-off events. [2022-12-06 05:41:05,459 INFO L131 PetriNetUnfolder]: For 10838/10871 co-relation queries the response was YES. [2022-12-06 05:41:05,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 560 events. 267/560 cut-off events. For 10838/10871 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2766 event pairs, 100 based on Foata normal form. 16/576 useless extension candidates. Maximal degree in co-relation 4123. Up to 386 conditions per place. [2022-12-06 05:41:05,462 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 105 selfloop transitions, 1 changer transitions 4/111 dead transitions. [2022-12-06 05:41:05,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 111 transitions, 1942 flow [2022-12-06 05:41:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:41:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:41:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 05:41:05,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:41:05,463 INFO L175 Difference]: Start difference. First operand has 122 places, 101 transitions, 1689 flow. Second operand 4 states and 45 transitions. [2022-12-06 05:41:05,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 111 transitions, 1942 flow [2022-12-06 05:41:05,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1838 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-06 05:41:05,480 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 1527 flow [2022-12-06 05:41:05,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1527, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2022-12-06 05:41:05,480 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 05:41:05,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:05,480 INFO L89 Accepts]: Start accepts. Operand has 115 places, 99 transitions, 1527 flow [2022-12-06 05:41:05,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:05,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:05,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 99 transitions, 1527 flow [2022-12-06 05:41:05,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 99 transitions, 1527 flow [2022-12-06 05:41:05,504 INFO L130 PetriNetUnfolder]: 66/263 cut-off events. [2022-12-06 05:41:05,505 INFO L131 PetriNetUnfolder]: For 4661/4737 co-relation queries the response was YES. [2022-12-06 05:41:05,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 263 events. 66/263 cut-off events. For 4661/4737 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1532 event pairs, 5 based on Foata normal form. 34/296 useless extension candidates. Maximal degree in co-relation 1491. Up to 63 conditions per place. [2022-12-06 05:41:05,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 99 transitions, 1527 flow [2022-12-06 05:41:05,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:41:05,507 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:05,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 05:41:05,508 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 99 transitions, 1527 flow [2022-12-06 05:41:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:05,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:05,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:05,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 05:41:05,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 05:41:05,713 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash 179431310, now seen corresponding path program 1 times [2022-12-06 05:41:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:05,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517002905] [2022-12-06 05:41:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:05,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517002905] [2022-12-06 05:41:05,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517002905] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:05,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445437765] [2022-12-06 05:41:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:05,772 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:05,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 05:41:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:05,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:41:05,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:05,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:41:05,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445437765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:05,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:41:05,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 05:41:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136798026] [2022-12-06 05:41:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:05,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:41:05,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:05,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:41:05,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:41:05,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:41:05,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 99 transitions, 1527 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:05,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:05,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:41:05,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:06,126 INFO L130 PetriNetUnfolder]: 262/550 cut-off events. [2022-12-06 05:41:06,126 INFO L131 PetriNetUnfolder]: For 10330/10365 co-relation queries the response was YES. [2022-12-06 05:41:06,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 550 events. 262/550 cut-off events. For 10330/10365 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2676 event pairs, 85 based on Foata normal form. 10/560 useless extension candidates. Maximal degree in co-relation 3757. Up to 386 conditions per place. [2022-12-06 05:41:06,131 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 101 selfloop transitions, 7 changer transitions 2/111 dead transitions. [2022-12-06 05:41:06,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 1802 flow [2022-12-06 05:41:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 05:41:06,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.376 [2022-12-06 05:41:06,132 INFO L175 Difference]: Start difference. First operand has 113 places, 99 transitions, 1527 flow. Second operand 5 states and 47 transitions. [2022-12-06 05:41:06,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 1802 flow [2022-12-06 05:41:06,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 1795 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:06,155 INFO L231 Difference]: Finished difference. Result has 114 places, 98 transitions, 1514 flow [2022-12-06 05:41:06,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1514, PETRI_PLACES=114, PETRI_TRANSITIONS=98} [2022-12-06 05:41:06,155 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 05:41:06,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:06,155 INFO L89 Accepts]: Start accepts. Operand has 114 places, 98 transitions, 1514 flow [2022-12-06 05:41:06,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:06,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:06,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 98 transitions, 1514 flow [2022-12-06 05:41:06,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 98 transitions, 1514 flow [2022-12-06 05:41:06,184 INFO L130 PetriNetUnfolder]: 65/260 cut-off events. [2022-12-06 05:41:06,184 INFO L131 PetriNetUnfolder]: For 4539/4620 co-relation queries the response was YES. [2022-12-06 05:41:06,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 260 events. 65/260 cut-off events. For 4539/4620 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1494 event pairs, 4 based on Foata normal form. 34/293 useless extension candidates. Maximal degree in co-relation 1332. Up to 63 conditions per place. [2022-12-06 05:41:06,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 98 transitions, 1514 flow [2022-12-06 05:41:06,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:41:06,188 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:06,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:41:06,188 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 98 transitions, 1514 flow [2022-12-06 05:41:06,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:06,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:06,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:06,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:06,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 05:41:06,395 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash -240603722, now seen corresponding path program 1 times [2022-12-06 05:41:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:06,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432566042] [2022-12-06 05:41:06,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:06,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:06,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:06,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432566042] [2022-12-06 05:41:06,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432566042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:06,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558018565] [2022-12-06 05:41:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:06,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:06,794 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:06,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 05:41:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:06,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:41:06,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:07,051 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 05:41:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:07,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:07,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:07,149 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 42 treesize of output 30 [2022-12-06 05:41:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:07,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558018565] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:07,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 05:41:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714157530] [2022-12-06 05:41:07,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:07,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:41:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:41:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:41:07,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 05:41:07,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 98 transitions, 1514 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:07,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:07,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 05:41:07,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:07,674 INFO L130 PetriNetUnfolder]: 279/600 cut-off events. [2022-12-06 05:41:07,674 INFO L131 PetriNetUnfolder]: For 10622/10658 co-relation queries the response was YES. [2022-12-06 05:41:07,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 600 events. 279/600 cut-off events. For 10622/10658 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3099 event pairs, 55 based on Foata normal form. 41/641 useless extension candidates. Maximal degree in co-relation 3727. Up to 465 conditions per place. [2022-12-06 05:41:07,679 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 103 selfloop transitions, 36 changer transitions 6/146 dead transitions. [2022-12-06 05:41:07,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 146 transitions, 2130 flow [2022-12-06 05:41:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:41:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:41:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2022-12-06 05:41:07,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 05:41:07,680 INFO L175 Difference]: Start difference. First operand has 114 places, 98 transitions, 1514 flow. Second operand 13 states and 96 transitions. [2022-12-06 05:41:07,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 146 transitions, 2130 flow [2022-12-06 05:41:07,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 146 transitions, 2120 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:07,705 INFO L231 Difference]: Finished difference. Result has 128 places, 109 transitions, 1754 flow [2022-12-06 05:41:07,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1754, PETRI_PLACES=128, PETRI_TRANSITIONS=109} [2022-12-06 05:41:07,705 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2022-12-06 05:41:07,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:07,706 INFO L89 Accepts]: Start accepts. Operand has 128 places, 109 transitions, 1754 flow [2022-12-06 05:41:07,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:07,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:07,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 109 transitions, 1754 flow [2022-12-06 05:41:07,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 109 transitions, 1754 flow [2022-12-06 05:41:07,741 INFO L130 PetriNetUnfolder]: 68/290 cut-off events. [2022-12-06 05:41:07,741 INFO L131 PetriNetUnfolder]: For 5298/5375 co-relation queries the response was YES. [2022-12-06 05:41:07,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 290 events. 68/290 cut-off events. For 5298/5375 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1791 event pairs, 5 based on Foata normal form. 33/322 useless extension candidates. Maximal degree in co-relation 1665. Up to 73 conditions per place. [2022-12-06 05:41:07,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 109 transitions, 1754 flow [2022-12-06 05:41:07,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 05:41:07,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:07,882 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:07,883 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,120 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,120 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,120 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,120 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, 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_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:08,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [553] $Ultimate##0-->L47-4: Formula: (and (= (+ v_~q_back~0_208 1) v_~q_back~0_207) (= (ite (= 1 (select (select |v_#memory_int_164| v_~q~0.base_122) (+ v_~q~0.offset_122 (* v_~q_back~0_208 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (< |v_thread1Thread1of1ForFork0_~i~0#1_53| (+ 1 v_~N~0_85)) (not (= (ite (and (< v_~q_back~0_208 v_~n~0_137) (<= 0 v_~q_back~0_208)) 1 0) 0))) InVars {~q_back~0=v_~q_back~0_208, #memory_int=|v_#memory_int_164|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_29|, ~q_back~0=v_~q_back~0_207, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_25|, 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_53|, #memory_int=|v_#memory_int_164|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_25|, ~N~0=v_~N~0_85, ~q~0.base=v_~q~0.base_122, ~n~0=v_~n~0_137, ~q~0.offset=v_~q~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:08,558 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,558 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,636 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,636 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:08,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:08,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:08,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:09,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_384| v_~q~0.base_261)) (.cse2 (* v_~q_back~0_492 4))) (and (not (= (ite (let ((.cse0 (+ v_~q_back~0_492 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_272))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|) (= (+ v_~s~0_286 |v_thread2Thread1of1ForFork1_~j~0#1_169|) v_~s~0_285) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_169| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (<= 0 v_~q_front~0_360) (< v_~q_front~0_360 v_~n~0_272) (< v_~q_front~0_360 v_~q_back~0_491)) 1 0)) (= (+ 2 v_~q_back~0_492) v_~q_back~0_491) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152| 0)) (= (+ 1 v_~q_front~0_360) v_~q_front~0_359) (= (select .cse1 (+ (* 4 v_~q_front~0_360) v_~q~0.offset_261)) |v_thread2Thread1of1ForFork1_~j~0#1_169|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_261)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|) (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_261 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (= |v_thread1Thread1of1ForFork0_~i~0#1_215| 2) (not (= (ite (and (< v_~q_back~0_492 v_~n~0_272) (<= 0 v_~q_back~0_492)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_215| (+ v_~N~0_190 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| 0)))) InVars {~q_back~0=v_~q_back~0_492, #memory_int=|v_#memory_int_384|, ~N~0=v_~N~0_190, ~q~0.base=v_~q~0.base_261, ~n~0=v_~n~0_272, ~q~0.offset=v_~q~0.offset_261, ~s~0=v_~s~0_286, ~q_front~0=v_~q_front~0_360} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_169|, ~q_back~0=v_~q_back~0_491, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_152|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_139|, ~N~0=v_~N~0_190, ~q~0.base=v_~q~0.base_261, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_152|, ~q~0.offset=v_~q~0.offset_261, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_143|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_139|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_215|, #memory_int=|v_#memory_int_384|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|, ~n~0=v_~n~0_272, ~s~0=v_~s~0_285, ~q_front~0=v_~q_front~0_359} 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, ~s~0, ~q_front~0] and [683] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_498| v_~q~0.base_343))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_120| 0) (= (+ v_~q_back~0_677 1) v_~q_back~0_676) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303| 0)) (= (+ v_~s~0_480 |v_thread2Thread1of1ForFork1_~j~0#1_304|) v_~s~0_479) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_313| v_~N~0_252)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_120| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278| (ite (and (<= 0 v_~q_front~0_556) (< v_~q_front~0_556 v_~n~0_352) (< v_~q_front~0_556 v_~q_back~0_676)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_304| 0)) (= (+ 1 v_~q_front~0_556) v_~q_front~0_555) (not (= (ite (and (< v_~q_back~0_677 v_~n~0_352) (<= 0 v_~q_back~0_677)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303| (ite (= (select .cse0 (+ (* v_~q_back~0_677 4) v_~q~0.offset_343)) 0) 1 0)) (= (select .cse0 (+ v_~q~0.offset_343 (* 4 v_~q_front~0_556))) |v_thread2Thread1of1ForFork1_~j~0#1_304|))) InVars {~q_back~0=v_~q_back~0_677, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, #memory_int=|v_#memory_int_498|, ~N~0=v_~N~0_252, ~q~0.base=v_~q~0.base_343, ~n~0=v_~n~0_352, ~q~0.offset=v_~q~0.offset_343, ~s~0=v_~s~0_480, ~q_front~0=v_~q_front~0_556} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_304|, ~q_back~0=v_~q_back~0_676, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_120|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_138|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_278|, ~N~0=v_~N~0_252, ~q~0.base=v_~q~0.base_343, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_278|, ~q~0.offset=v_~q~0.offset_343, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_303|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_313|, #memory_int=|v_#memory_int_498|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_138|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_303|, ~n~0=v_~n~0_352, ~s~0=v_~s~0_479, ~q_front~0=v_~q_front~0_555, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_120|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#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~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:09,071 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,071 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,071 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,071 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,071 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,071 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,376 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,377 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,377 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,377 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,377 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,377 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [684] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_500| v_~q~0.base_345))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_681 4) v_~q~0.offset_345)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|) (= (+ v_~q_back~0_681 1) v_~q_back~0_680) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_315| v_~N~0_254)) (= (+ 1 v_~q_front~0_560) v_~q_front~0_559) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280| (ite (and (< v_~q_front~0_560 v_~n~0_354) (< v_~q_front~0_560 v_~q_back~0_680) (<= 0 v_~q_front~0_560)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_306| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_122| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280| 0)) (= v_~s~0_483 (+ v_~s~0_484 |v_thread2Thread1of1ForFork1_~j~0#1_306|)) (= (select .cse0 (+ (* 4 v_~q_front~0_560) v_~q~0.offset_345)) |v_thread2Thread1of1ForFork1_~j~0#1_306|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_122| 0) (not (= (ite (and (< v_~q_back~0_681 v_~n~0_354) (<= 0 v_~q_back~0_681)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_681, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_500|, ~N~0=v_~N~0_254, ~q~0.base=v_~q~0.base_345, ~n~0=v_~n~0_354, ~q~0.offset=v_~q~0.offset_345, ~s~0=v_~s~0_484, ~q_front~0=v_~q_front~0_560} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_306|, ~q_back~0=v_~q_back~0_680, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_122|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_140|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_280|, ~N~0=v_~N~0_254, ~q~0.base=v_~q~0.base_345, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_280|, ~q~0.offset=v_~q~0.offset_345, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_305|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_315|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|, ~n~0=v_~n~0_354, ~s~0=v_~s~0_483, ~q_front~0=v_~q_front~0_559, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_122|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#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~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:09,756 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,756 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:09,940 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 05:41:09,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2234 [2022-12-06 05:41:09,940 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 103 transitions, 1807 flow [2022-12-06 05:41:09,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:09,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:09,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:09,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 05:41:10,148 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1095701216, now seen corresponding path program 2 times [2022-12-06 05:41:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393164297] [2022-12-06 05:41:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:10,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393164297] [2022-12-06 05:41:10,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393164297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:10,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841985842] [2022-12-06 05:41:10,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:41:10,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:10,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:10,482 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:10,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 05:41:10,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:41:10,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:41:10,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:41:10,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:10,683 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 05:41:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:10,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:10,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:10,756 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 28 [2022-12-06 05:41:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:10,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841985842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:10,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:10,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:41:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425442124] [2022-12-06 05:41:10,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:41:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:41:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:41:10,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:41:10,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 103 transitions, 1807 flow. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:10,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:10,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:41:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:11,020 INFO L130 PetriNetUnfolder]: 248/536 cut-off events. [2022-12-06 05:41:11,020 INFO L131 PetriNetUnfolder]: For 11152/11182 co-relation queries the response was YES. [2022-12-06 05:41:11,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 536 events. 248/536 cut-off events. For 11152/11182 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2711 event pairs, 50 based on Foata normal form. 33/569 useless extension candidates. Maximal degree in co-relation 4020. Up to 441 conditions per place. [2022-12-06 05:41:11,024 INFO L137 encePairwiseOnDemand]: 12/34 looper letters, 84 selfloop transitions, 27 changer transitions 8/120 dead transitions. [2022-12-06 05:41:11,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 2074 flow [2022-12-06 05:41:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:41:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:41:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 05:41:11,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2689075630252101 [2022-12-06 05:41:11,025 INFO L175 Difference]: Start difference. First operand has 121 places, 103 transitions, 1807 flow. Second operand 7 states and 64 transitions. [2022-12-06 05:41:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 2074 flow [2022-12-06 05:41:11,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 1877 flow, removed 72 selfloop flow, removed 9 redundant places. [2022-12-06 05:41:11,045 INFO L231 Difference]: Finished difference. Result has 120 places, 101 transitions, 1587 flow [2022-12-06 05:41:11,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1587, PETRI_PLACES=120, PETRI_TRANSITIONS=101} [2022-12-06 05:41:11,045 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 05:41:11,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:11,045 INFO L89 Accepts]: Start accepts. Operand has 120 places, 101 transitions, 1587 flow [2022-12-06 05:41:11,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:11,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:11,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 101 transitions, 1587 flow [2022-12-06 05:41:11,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 101 transitions, 1587 flow [2022-12-06 05:41:11,069 INFO L130 PetriNetUnfolder]: 65/256 cut-off events. [2022-12-06 05:41:11,069 INFO L131 PetriNetUnfolder]: For 4088/4185 co-relation queries the response was YES. [2022-12-06 05:41:11,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 256 events. 65/256 cut-off events. For 4088/4185 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1466 event pairs, 2 based on Foata normal form. 41/297 useless extension candidates. Maximal degree in co-relation 1472. Up to 57 conditions per place. [2022-12-06 05:41:11,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 101 transitions, 1587 flow [2022-12-06 05:41:11,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 05:41:11,081 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,082 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [685] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_502| v_~q~0.base_347))) (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_124| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_317| v_~N~0_256)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_307| (ite (= (select .cse0 (+ (* v_~q_back~0_685 4) v_~q~0.offset_347)) 0) 1 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_564) v_~q~0.offset_347)) |v_thread2Thread1of1ForFork1_~j~0#1_308|) (not (= (ite (and (<= 0 v_~q_back~0_685) (< v_~q_back~0_685 v_~n~0_356)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| (ite (and (< v_~q_front~0_564 v_~q_back~0_684) (< v_~q_front~0_564 v_~n~0_356) (<= 0 v_~q_front~0_564)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|) (= (+ v_~q_back~0_685 1) v_~q_back~0_684) (= |v_thread1Thread1of1ForFork0_#res#1.base_124| 0) (= (+ v_~s~0_488 |v_thread2Thread1of1ForFork1_~j~0#1_308|) v_~s~0_487) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_307| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_308| 0)) (= (+ 1 v_~q_front~0_564) v_~q_front~0_563) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307| 0)))) InVars {~q_back~0=v_~q_back~0_685, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_317|, #memory_int=|v_#memory_int_502|, ~N~0=v_~N~0_256, ~q~0.base=v_~q~0.base_347, ~n~0=v_~n~0_356, ~q~0.offset=v_~q~0.offset_347, ~s~0=v_~s~0_488, ~q_front~0=v_~q_front~0_564} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_308|, ~q_back~0=v_~q_back~0_684, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_124|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_142|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_282|, ~N~0=v_~N~0_256, ~q~0.base=v_~q~0.base_347, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_282|, ~q~0.offset=v_~q~0.offset_347, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_307|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_317|, #memory_int=|v_#memory_int_502|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_142|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_307|, ~n~0=v_~n~0_356, ~s~0=v_~s~0_487, ~q_front~0=v_~q_front~0_563, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_124|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#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~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:11,134 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,134 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:11,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:11,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:11,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_488| v_~q~0.base_335))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_294| 0)) (= (+ v_~s~0_464 |v_thread2Thread1of1ForFork1_~j~0#1_294|) v_~s~0_463) (= (+ v_~q_back~0_665 1) v_~q_back~0_664) (not (= (ite (and (< v_~q_back~0_665 v_~n~0_344) (<= 0 v_~q_back~0_665)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_309| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_299| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_299|) (= (ite (= (select .cse0 (+ (* v_~q_back~0_665 4) v_~q~0.offset_335)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_299|) (= |v_thread2Thread1of1ForFork1_~j~0#1_294| (select .cse0 (+ (* 4 v_~q_front~0_540) v_~q~0.offset_335))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| (ite (and (< v_~q_front~0_540 v_~n~0_344) (<= 0 v_~q_front~0_540) (< v_~q_front~0_540 v_~q_back~0_664)) 1 0)) (= (+ 1 v_~q_front~0_540) v_~q_front~0_539) (< |v_thread1Thread1of1ForFork0_~i~0#1_309| (+ v_~N~0_248 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_299| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268| 0)))) InVars {~q_back~0=v_~q_back~0_665, #memory_int=|v_#memory_int_488|, ~N~0=v_~N~0_248, ~q~0.base=v_~q~0.base_335, ~n~0=v_~n~0_344, ~q~0.offset=v_~q~0.offset_335, ~s~0=v_~s~0_464, ~q_front~0=v_~q_front~0_540} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_294|, ~q_back~0=v_~q_back~0_664, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_268|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_205|, ~N~0=v_~N~0_248, ~q~0.base=v_~q~0.base_335, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_268|, ~q~0.offset=v_~q~0.offset_335, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_299|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_209|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_205|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_309|, #memory_int=|v_#memory_int_488|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_299|, ~n~0=v_~n~0_344, ~s~0=v_~s~0_463, ~q_front~0=v_~q_front~0_539} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:11,756 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,756 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,756 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,756 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,756 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,756 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:11,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:12,099 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:12,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1055 [2022-12-06 05:41:12,100 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 1673 flow [2022-12-06 05:41:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:12,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:12,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:12,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:12,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:12,301 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:12,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1762199450, now seen corresponding path program 1 times [2022-12-06 05:41:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:12,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865532107] [2022-12-06 05:41:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:12,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865532107] [2022-12-06 05:41:12,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865532107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:12,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310203629] [2022-12-06 05:41:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:12,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:12,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:12,662 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:12,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 05:41:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:41:12,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:12,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:12,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:12,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:12,852 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 46 treesize of output 12 [2022-12-06 05:41:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:12,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:12,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:12,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 157 [2022-12-06 05:41:12,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:12,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 94 [2022-12-06 05:41:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:13,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310203629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:13,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:13,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:41:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661699869] [2022-12-06 05:41:13,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:13,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:41:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:41:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:41:13,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:41:13,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 1673 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:13,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:13,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:41:13,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:13,403 INFO L130 PetriNetUnfolder]: 254/547 cut-off events. [2022-12-06 05:41:13,403 INFO L131 PetriNetUnfolder]: For 9475/9509 co-relation queries the response was YES. [2022-12-06 05:41:13,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 547 events. 254/547 cut-off events. For 9475/9509 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2831 event pairs, 49 based on Foata normal form. 31/578 useless extension candidates. Maximal degree in co-relation 4023. Up to 443 conditions per place. [2022-12-06 05:41:13,407 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 100 selfloop transitions, 17 changer transitions 9/127 dead transitions. [2022-12-06 05:41:13,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 127 transitions, 2129 flow [2022-12-06 05:41:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:41:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:41:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-06 05:41:13,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2744360902255639 [2022-12-06 05:41:13,408 INFO L175 Difference]: Start difference. First operand has 116 places, 100 transitions, 1673 flow. Second operand 7 states and 73 transitions. [2022-12-06 05:41:13,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 127 transitions, 2129 flow [2022-12-06 05:41:13,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 2008 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-06 05:41:13,430 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 1574 flow [2022-12-06 05:41:13,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1574, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2022-12-06 05:41:13,431 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 05:41:13,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:13,432 INFO L89 Accepts]: Start accepts. Operand has 115 places, 99 transitions, 1574 flow [2022-12-06 05:41:13,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:13,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:13,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 99 transitions, 1574 flow [2022-12-06 05:41:13,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 99 transitions, 1574 flow [2022-12-06 05:41:13,456 INFO L130 PetriNetUnfolder]: 67/263 cut-off events. [2022-12-06 05:41:13,457 INFO L131 PetriNetUnfolder]: For 4095/4199 co-relation queries the response was YES. [2022-12-06 05:41:13,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 263 events. 67/263 cut-off events. For 4095/4199 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1535 event pairs, 3 based on Foata normal form. 34/296 useless extension candidates. Maximal degree in co-relation 1488. Up to 60 conditions per place. [2022-12-06 05:41:13,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 99 transitions, 1574 flow [2022-12-06 05:41:13,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 05:41:13,464 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,464 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,464 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,464 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,464 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,464 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,778 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,778 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,778 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,778 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,778 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:13,778 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:14,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [673] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_480| v_~q~0.base_329))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_116| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_301| 1) (= v_~q_back~0_646 (+ 2 v_~q_back~0_648)) (not (= 0 (ite (and (< v_~q_back~0_648 v_~n~0_338) (<= 0 v_~q_back~0_648)) 1 0))) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_648 4) v_~q~0.offset_329)) 1) 1 0) 0)) (not (= (ite (and (<= 1 v_~q_back~0_646) (< v_~q_back~0_646 (+ v_~n~0_338 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_301| (+ v_~N~0_242 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| (ite (= (select .cse0 (+ (* v_~q_back~0_646 4) (- 4) v_~q~0.offset_329)) 0) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_116| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_301| v_~N~0_242)))) InVars {~q_back~0=v_~q_back~0_648, #memory_int=|v_#memory_int_480|, ~N~0=v_~N~0_242, ~q~0.base=v_~q~0.base_329, ~n~0=v_~n~0_338, ~q~0.offset=v_~q~0.offset_329} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_116|, ~q_back~0=v_~q_back~0_646, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_134|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_197|, ~N~0=v_~N~0_242, ~q~0.base=v_~q~0.base_329, ~q~0.offset=v_~q~0.offset_329, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_201|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_197|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_134|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|, #memory_int=|v_#memory_int_480|, ~n~0=v_~n~0_338, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_116|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] and [549] L108-6-->L92-2: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| v_~q~0.base_114) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|) (= |v_ULTIMATE.start_main_#t~pre12#1_45| |v_#pthreadsForks_34|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| v_~q~0.offset_114) (= (ite (<= 0 v_~N~0_77) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (store |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre12#1_45|)) |v_#memory_int_152|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, #memory_int=|v_#memory_int_153|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~q~0.base=v_~q~0.base_114, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~q~0.offset=v_~q~0.offset_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_45|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_43|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_43|, #memory_int=|v_#memory_int_152|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 05:41:14,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_485| v_~q~0.base_333)) (.cse1 (* v_~q_back~0_660 4))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_295| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_333 4)) 0) 1 0)) (not (= (ite (and (< v_~q_back~0_660 v_~n~0_342) (<= 0 v_~q_back~0_660)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_144| |v_#pthreadsForks_174|) (= |v_thread1Thread1of1ForFork0_~i~0#1_307| 1) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_333)) 1) 1 0))) (= (+ 2 v_~q_back~0_660) v_~q_back~0_658) (< |v_thread1Thread1of1ForFork0_~i~0#1_307| (+ v_~N~0_246 1)) (= (+ |v_#pthreadsForks_174| 1) |v_#pthreadsForks_173|) (not (= (ite (let ((.cse2 (+ v_~q_back~0_660 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_342))) 1 0) 0)) (= (store |v_#memory_int_485| |v_ULTIMATE.start_main_~#t2~0#1.base_108| (store (select |v_#memory_int_485| |v_ULTIMATE.start_main_~#t2~0#1.base_108|) |v_ULTIMATE.start_main_~#t2~0#1.offset_106| |v_ULTIMATE.start_main_#t~pre14#1_144|)) |v_#memory_int_484|) (= |v_thread1Thread1of1ForFork0_#res#1.base_118| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_307| v_~N~0_246)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_118| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_295|))) InVars {~q_back~0=v_~q_back~0_660, #pthreadsForks=|v_#pthreadsForks_174|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_106|, #memory_int=|v_#memory_int_485|, ~N~0=v_~N~0_246, ~q~0.base=v_~q~0.base_333, ~n~0=v_~n~0_342, ~q~0.offset=v_~q~0.offset_333, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_108|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_118|, ~q_back~0=v_~q_back~0_658, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_136|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_106|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_203|, ~N~0=v_~N~0_246, ~q~0.base=v_~q~0.base_333, ~q~0.offset=v_~q~0.offset_333, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_144|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_295|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_144|, #pthreadsForks=|v_#pthreadsForks_173|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_207|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_203|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_307|, #memory_int=|v_#memory_int_484|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_118|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_295|, ~n~0=v_~n~0_342, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_108|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_118|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base] and [549] L108-6-->L92-2: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| v_~q~0.base_114) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|) (= |v_ULTIMATE.start_main_#t~pre12#1_45| |v_#pthreadsForks_34|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30| v_~q~0.offset_114) (= (ite (<= 0 v_~N~0_77) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (store |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_153| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre12#1_45|)) |v_#memory_int_152|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, #memory_int=|v_#memory_int_153|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_52|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~q~0.base=v_~q~0.base_114, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~q~0.offset=v_~q~0.offset_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_45|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_43|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_43|, #memory_int=|v_#memory_int_152|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 05:41:14,774 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:41:14,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1342 [2022-12-06 05:41:14,775 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 1646 flow [2022-12-06 05:41:14,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:14,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:14,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:14,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:14,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:14,975 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash 218061805, now seen corresponding path program 1 times [2022-12-06 05:41:14,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:14,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907072403] [2022-12-06 05:41:14,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907072403] [2022-12-06 05:41:15,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907072403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:15,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:41:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670153017] [2022-12-06 05:41:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:15,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:41:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:15,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:41:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:41:15,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:41:15,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 05:41:15,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:15,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:41:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:15,473 INFO L130 PetriNetUnfolder]: 244/521 cut-off events. [2022-12-06 05:41:15,473 INFO L131 PetriNetUnfolder]: For 9645/9710 co-relation queries the response was YES. [2022-12-06 05:41:15,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 521 events. 244/521 cut-off events. For 9645/9710 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2626 event pairs, 80 based on Foata normal form. 9/530 useless extension candidates. Maximal degree in co-relation 3609. Up to 472 conditions per place. [2022-12-06 05:41:15,476 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 93 selfloop transitions, 10 changer transitions 10/114 dead transitions. [2022-12-06 05:41:15,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 1912 flow [2022-12-06 05:41:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:41:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:41:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 05:41:15,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2625 [2022-12-06 05:41:15,476 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 1646 flow. Second operand 6 states and 63 transitions. [2022-12-06 05:41:15,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 114 transitions, 1912 flow [2022-12-06 05:41:15,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 114 transitions, 1808 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-12-06 05:41:15,491 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 1552 flow [2022-12-06 05:41:15,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1552, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2022-12-06 05:41:15,491 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:41:15,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:15,492 INFO L89 Accepts]: Start accepts. Operand has 110 places, 100 transitions, 1552 flow [2022-12-06 05:41:15,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:15,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:15,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 100 transitions, 1552 flow [2022-12-06 05:41:15,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 100 transitions, 1552 flow [2022-12-06 05:41:15,515 INFO L130 PetriNetUnfolder]: 67/256 cut-off events. [2022-12-06 05:41:15,515 INFO L131 PetriNetUnfolder]: For 3232/3326 co-relation queries the response was YES. [2022-12-06 05:41:15,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 256 events. 67/256 cut-off events. For 3232/3326 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1478 event pairs, 3 based on Foata normal form. 35/291 useless extension candidates. Maximal degree in co-relation 1436. Up to 58 conditions per place. [2022-12-06 05:41:15,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 100 transitions, 1552 flow [2022-12-06 05:41:15,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 05:41:15,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_511| v_~q~0.base_355)) (.cse2 (* 4 v_~q_front~0_590))) (let ((.cse3 (select .cse1 (+ .cse2 v_~q~0.offset_355)))) (and (not (= |v_thread2Thread1of1ForFork1_~j~0#1_326| 0)) (= (+ 2 v_~q_front~0_590) v_~q_front~0_588) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| (ite (let ((.cse0 (+ 1 v_~q_front~0_590))) (and (<= 0 .cse0) (< .cse0 v_~n~0_364) (< .cse0 v_~q_back~0_704))) 1 0)) (not (= (ite (and (< v_~q_front~0_590 v_~n~0_364) (< v_~q_front~0_590 v_~q_back~0_704) (<= 0 v_~q_front~0_590)) 1 0) 0)) (= (select .cse1 (+ .cse2 v_~q~0.offset_355 4)) |v_thread2Thread1of1ForFork1_~j~0#1_326|) (= (+ v_~s~0_515 |v_thread2Thread1of1ForFork1_~j~0#1_326| .cse3) v_~s~0_513) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299| 0)) (not (= 0 .cse3))))) InVars {~q_back~0=v_~q_back~0_704, #memory_int=|v_#memory_int_511|, ~q~0.base=v_~q~0.base_355, ~n~0=v_~n~0_364, ~q~0.offset=v_~q~0.offset_355, ~s~0=v_~s~0_515, ~q_front~0=v_~q_front~0_590} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_299|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_326|, ~q_back~0=v_~q_back~0_704, #memory_int=|v_#memory_int_511|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_299|, ~q~0.base=v_~q~0.base_355, ~n~0=v_~n~0_364, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_299|, ~q~0.offset=v_~q~0.offset_355, ~s~0=v_~s~0_513, ~q_front~0=v_~q_front~0_588} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [697] L47-4-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_517| v_~q~0.base_361))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324| (ite (= (select .cse0 (+ (* v_~q_back~0_715 4) v_~q~0.offset_361)) 0) 1 0)) (= v_~q_back~0_714 (+ v_~q_back~0_715 1)) (= (select .cse0 (+ (* 4 v_~q_front~0_605) v_~q~0.offset_361)) |v_thread2Thread1of1ForFork1_~j~0#1_336|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_138| 0) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_336| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324| 0)) (not (= (ite (and (<= 0 v_~q_back~0_715) (< v_~q_back~0_715 v_~n~0_370)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_138| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309| 0)) (= (+ v_~s~0_530 |v_thread2Thread1of1ForFork1_~j~0#1_336|) v_~s~0_529) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309| (ite (and (< v_~q_front~0_605 v_~n~0_370) (< v_~q_front~0_605 v_~q_back~0_714) (<= 0 v_~q_front~0_605)) 1 0)) (= (+ 1 v_~q_front~0_605) v_~q_front~0_604) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_331| v_~N~0_268)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|))) InVars {~q_back~0=v_~q_back~0_715, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_517|, ~N~0=v_~N~0_268, ~q~0.base=v_~q~0.base_361, ~n~0=v_~n~0_370, ~q~0.offset=v_~q~0.offset_361, ~s~0=v_~s~0_530, ~q_front~0=v_~q_front~0_605} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_336|, ~q_back~0=v_~q_back~0_714, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_138|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_156|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_309|, ~N~0=v_~N~0_268, ~q~0.base=v_~q~0.base_361, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_309|, ~q~0.offset=v_~q~0.offset_361, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_517|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_156|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_324|, ~n~0=v_~n~0_370, ~s~0=v_~s~0_529, ~q_front~0=v_~q_front~0_604, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_138|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#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~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:15,518 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:15,518 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:15,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:15,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 05:41:15,730 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 1567 flow [2022-12-06 05:41:15,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 05:41:15,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:15,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:15,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 05:41:15,734 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 398901620, now seen corresponding path program 1 times [2022-12-06 05:41:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:15,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929725460] [2022-12-06 05:41:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929725460] [2022-12-06 05:41:15,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929725460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439694898] [2022-12-06 05:41:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:15,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:15,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:15,799 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:15,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 05:41:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:15,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:41:15,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:15,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:41:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439694898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:41:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 05:41:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436815528] [2022-12-06 05:41:15,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:15,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:41:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:41:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:41:15,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:41:15,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 1567 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:15,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:15,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:41:15,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:16,046 INFO L130 PetriNetUnfolder]: 237/509 cut-off events. [2022-12-06 05:41:16,046 INFO L131 PetriNetUnfolder]: For 8162/8210 co-relation queries the response was YES. [2022-12-06 05:41:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 509 events. 237/509 cut-off events. For 8162/8210 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2557 event pairs, 84 based on Foata normal form. 18/527 useless extension candidates. Maximal degree in co-relation 3471. Up to 431 conditions per place. [2022-12-06 05:41:16,049 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 101 selfloop transitions, 1 changer transitions 2/105 dead transitions. [2022-12-06 05:41:16,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 1732 flow [2022-12-06 05:41:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:41:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:41:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 05:41:16,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:41:16,049 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 1567 flow. Second operand 3 states and 52 transitions. [2022-12-06 05:41:16,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 1732 flow [2022-12-06 05:41:16,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 1704 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 05:41:16,062 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 1422 flow [2022-12-06 05:41:16,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1422, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2022-12-06 05:41:16,062 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 05:41:16,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:16,062 INFO L89 Accepts]: Start accepts. Operand has 107 places, 96 transitions, 1422 flow [2022-12-06 05:41:16,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:16,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:16,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 96 transitions, 1422 flow [2022-12-06 05:41:16,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 96 transitions, 1422 flow [2022-12-06 05:41:16,084 INFO L130 PetriNetUnfolder]: 64/249 cut-off events. [2022-12-06 05:41:16,084 INFO L131 PetriNetUnfolder]: For 3176/3270 co-relation queries the response was YES. [2022-12-06 05:41:16,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 249 events. 64/249 cut-off events. For 3176/3270 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1432 event pairs, 2 based on Foata normal form. 35/284 useless extension candidates. Maximal degree in co-relation 1318. Up to 57 conditions per place. [2022-12-06 05:41:16,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 96 transitions, 1422 flow [2022-12-06 05:41:16,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 05:41:16,086 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_387| v_~q~0.base_263)) (.cse1 (* v_~q_back~0_496 4))) (and (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_263)) 1) 1 0))) (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_263 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_202|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_202| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|) (= |v_thread1Thread1of1ForFork0_~i~0#1_217| 2) (= (+ 2 v_~q_back~0_496) v_~q_back~0_495) (= (store |v_#memory_int_387| |v_ULTIMATE.start_main_~#t2~0#1.base_100| (store (select |v_#memory_int_387| |v_ULTIMATE.start_main_~#t2~0#1.base_100|) |v_ULTIMATE.start_main_~#t2~0#1.offset_98| |v_ULTIMATE.start_main_#t~pre14#1_118|)) |v_#memory_int_386|) (= (+ |v_#pthreadsForks_149| 1) |v_#pthreadsForks_148|) (= |v_ULTIMATE.start_main_#t~pre14#1_118| |v_#pthreadsForks_149|) (not (= (ite (let ((.cse2 (+ v_~q_back~0_496 1))) (and (< .cse2 v_~n~0_274) (<= 0 .cse2))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_217| (+ v_~N~0_192 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202| 0)) (not (= (ite (and (<= 0 v_~q_back~0_496) (< v_~q_back~0_496 v_~n~0_274)) 1 0) 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_149|, ~q_back~0=v_~q_back~0_496, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_98|, #memory_int=|v_#memory_int_387|, ~N~0=v_~N~0_192, ~q~0.base=v_~q~0.base_263, ~n~0=v_~n~0_274, ~q~0.offset=v_~q~0.offset_263, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_100|} OutVars{~q_back~0=v_~q_back~0_495, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_98|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_141|, ~N~0=v_~N~0_192, ~q~0.base=v_~q~0.base_263, ~q~0.offset=v_~q~0.offset_263, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_125|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_202|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_118|, #pthreadsForks=|v_#pthreadsForks_148|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_145|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_217|, #memory_int=|v_#memory_int_386|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_101|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|, ~n~0=v_~n~0_274, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_100|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:16,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:16,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 05:41:16,332 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 1437 flow [2022-12-06 05:41:16,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:16,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:16,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:16,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:16,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:16,533 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1256132338, now seen corresponding path program 1 times [2022-12-06 05:41:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:16,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163277000] [2022-12-06 05:41:16,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163277000] [2022-12-06 05:41:16,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163277000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11061641] [2022-12-06 05:41:16,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:16,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:16,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:16,844 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:16,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 05:41:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:16,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:41:17,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:17,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:17,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:41:17,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:41:17,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11061641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:17,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:41:17,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 05:41:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973797403] [2022-12-06 05:41:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:17,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:41:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:41:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:41:17,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:41:17,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 1437 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:41:17,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:17,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:41:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:17,177 INFO L130 PetriNetUnfolder]: 245/513 cut-off events. [2022-12-06 05:41:17,177 INFO L131 PetriNetUnfolder]: For 8352/8374 co-relation queries the response was YES. [2022-12-06 05:41:17,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 513 events. 245/513 cut-off events. For 8352/8374 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2496 event pairs, 40 based on Foata normal form. 28/540 useless extension candidates. Maximal degree in co-relation 3425. Up to 332 conditions per place. [2022-12-06 05:41:17,179 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 70 selfloop transitions, 41 changer transitions 0/112 dead transitions. [2022-12-06 05:41:17,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 112 transitions, 1813 flow [2022-12-06 05:41:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:41:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:41:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 05:41:17,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2022-12-06 05:41:17,180 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 1437 flow. Second operand 4 states and 50 transitions. [2022-12-06 05:41:17,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 112 transitions, 1813 flow [2022-12-06 05:41:17,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 112 transitions, 1806 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:41:17,192 INFO L231 Difference]: Finished difference. Result has 108 places, 100 transitions, 1619 flow [2022-12-06 05:41:17,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1619, PETRI_PLACES=108, PETRI_TRANSITIONS=100} [2022-12-06 05:41:17,192 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 87 predicate places. [2022-12-06 05:41:17,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:17,193 INFO L89 Accepts]: Start accepts. Operand has 108 places, 100 transitions, 1619 flow [2022-12-06 05:41:17,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:17,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:17,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 1619 flow [2022-12-06 05:41:17,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 1619 flow [2022-12-06 05:41:17,216 INFO L130 PetriNetUnfolder]: 67/257 cut-off events. [2022-12-06 05:41:17,216 INFO L131 PetriNetUnfolder]: For 3674/3756 co-relation queries the response was YES. [2022-12-06 05:41:17,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 257 events. 67/257 cut-off events. For 3674/3756 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1469 event pairs, 3 based on Foata normal form. 36/293 useless extension candidates. Maximal degree in co-relation 1470. Up to 59 conditions per place. [2022-12-06 05:41:17,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 1619 flow [2022-12-06 05:41:17,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 05:41:17,219 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:17,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 05:41:17,220 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 100 transitions, 1619 flow [2022-12-06 05:41:17,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:41:17,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:17,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:17,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:17,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-06 05:41:17,424 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1426880937, now seen corresponding path program 1 times [2022-12-06 05:41:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:17,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468739695] [2022-12-06 05:41:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:17,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468739695] [2022-12-06 05:41:17,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468739695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56186404] [2022-12-06 05:41:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:17,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:17,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:17,505 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:17,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 05:41:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:17,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:41:17,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:17,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:41:17,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56186404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:17,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:41:17,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 05:41:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94037986] [2022-12-06 05:41:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:17,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:41:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:41:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:41:17,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:41:17,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 100 transitions, 1619 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:41:17,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:17,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:41:17,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:17,778 INFO L130 PetriNetUnfolder]: 230/479 cut-off events. [2022-12-06 05:41:17,778 INFO L131 PetriNetUnfolder]: For 9046/9146 co-relation queries the response was YES. [2022-12-06 05:41:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 479 events. 230/479 cut-off events. For 9046/9146 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2299 event pairs, 71 based on Foata normal form. 29/508 useless extension candidates. Maximal degree in co-relation 3366. Up to 435 conditions per place. [2022-12-06 05:41:17,781 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 87 selfloop transitions, 0 changer transitions 18/106 dead transitions. [2022-12-06 05:41:17,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 1793 flow [2022-12-06 05:41:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 05:41:17,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:41:17,781 INFO L175 Difference]: Start difference. First operand has 108 places, 100 transitions, 1619 flow. Second operand 5 states and 54 transitions. [2022-12-06 05:41:17,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 1793 flow [2022-12-06 05:41:17,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 106 transitions, 1738 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:17,794 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 1353 flow [2022-12-06 05:41:17,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1353, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2022-12-06 05:41:17,795 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:41:17,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:17,795 INFO L89 Accepts]: Start accepts. Operand has 110 places, 88 transitions, 1353 flow [2022-12-06 05:41:17,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:17,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:17,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 88 transitions, 1353 flow [2022-12-06 05:41:17,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 1353 flow [2022-12-06 05:41:17,813 INFO L130 PetriNetUnfolder]: 62/218 cut-off events. [2022-12-06 05:41:17,813 INFO L131 PetriNetUnfolder]: For 3242/3328 co-relation queries the response was YES. [2022-12-06 05:41:17,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 218 events. 62/218 cut-off events. For 3242/3328 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1163 event pairs, 3 based on Foata normal form. 38/256 useless extension candidates. Maximal degree in co-relation 1210. Up to 55 conditions per place. [2022-12-06 05:41:17,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 88 transitions, 1353 flow [2022-12-06 05:41:17,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 05:41:17,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:17,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:41:17,816 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 1353 flow [2022-12-06 05:41:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:41:17,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:17,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:17,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:18,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:18,019 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1413979856, now seen corresponding path program 1 times [2022-12-06 05:41:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:18,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861310652] [2022-12-06 05:41:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:18,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861310652] [2022-12-06 05:41:18,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861310652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:18,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772437637] [2022-12-06 05:41:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:18,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:18,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:18,371 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:18,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 05:41:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:18,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:41:18,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:18,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:18,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:18,598 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 23 treesize of output 7 [2022-12-06 05:41:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:41:18,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:18,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:18,678 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 86 treesize of output 74 [2022-12-06 05:41:18,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:41:18,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:41:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:41:18,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772437637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:18,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:18,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-06 05:41:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259905324] [2022-12-06 05:41:18,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:18,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:41:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:18,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:41:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:41:18,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:41:18,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 1353 flow. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:18,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:18,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:41:18,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:19,150 INFO L130 PetriNetUnfolder]: 254/514 cut-off events. [2022-12-06 05:41:19,151 INFO L131 PetriNetUnfolder]: For 8434/8466 co-relation queries the response was YES. [2022-12-06 05:41:19,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 514 events. 254/514 cut-off events. For 8434/8466 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2458 event pairs, 36 based on Foata normal form. 34/548 useless extension candidates. Maximal degree in co-relation 3598. Up to 419 conditions per place. [2022-12-06 05:41:19,154 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 98 selfloop transitions, 25 changer transitions 4/128 dead transitions. [2022-12-06 05:41:19,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 128 transitions, 1947 flow [2022-12-06 05:41:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:41:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:41:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-12-06 05:41:19,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2827586206896552 [2022-12-06 05:41:19,155 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 1353 flow. Second operand 10 states and 82 transitions. [2022-12-06 05:41:19,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 128 transitions, 1947 flow [2022-12-06 05:41:19,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1835 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-12-06 05:41:19,168 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 1521 flow [2022-12-06 05:41:19,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1521, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2022-12-06 05:41:19,169 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 65 predicate places. [2022-12-06 05:41:19,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:19,169 INFO L89 Accepts]: Start accepts. Operand has 86 places, 100 transitions, 1521 flow [2022-12-06 05:41:19,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:19,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:19,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 100 transitions, 1521 flow [2022-12-06 05:41:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 100 transitions, 1521 flow [2022-12-06 05:41:19,190 INFO L130 PetriNetUnfolder]: 70/253 cut-off events. [2022-12-06 05:41:19,190 INFO L131 PetriNetUnfolder]: For 2952/3049 co-relation queries the response was YES. [2022-12-06 05:41:19,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 253 events. 70/253 cut-off events. For 2952/3049 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1411 event pairs, 5 based on Foata normal form. 45/298 useless extension candidates. Maximal degree in co-relation 1279. Up to 60 conditions per place. [2022-12-06 05:41:19,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 100 transitions, 1521 flow [2022-12-06 05:41:19,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 05:41:19,196 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:19,196 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:19,387 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:19,387 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:19,467 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:19,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 05:41:19,467 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 98 transitions, 1499 flow [2022-12-06 05:41:19,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:19,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:19,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:19,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:19,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:19,668 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1378661204, now seen corresponding path program 1 times [2022-12-06 05:41:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:19,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063352721] [2022-12-06 05:41:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:19,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:19,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063352721] [2022-12-06 05:41:19,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063352721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:19,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:19,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:41:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474736165] [2022-12-06 05:41:19,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:19,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:41:19,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:41:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:41:19,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 05:41:19,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 98 transitions, 1499 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:19,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:19,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 05:41:19,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:19,880 INFO L130 PetriNetUnfolder]: 366/721 cut-off events. [2022-12-06 05:41:19,881 INFO L131 PetriNetUnfolder]: For 9883/10004 co-relation queries the response was YES. [2022-12-06 05:41:19,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 721 events. 366/721 cut-off events. For 9883/10004 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3760 event pairs, 14 based on Foata normal form. 76/797 useless extension candidates. Maximal degree in co-relation 4707. Up to 308 conditions per place. [2022-12-06 05:41:19,884 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 74 selfloop transitions, 64 changer transitions 12/151 dead transitions. [2022-12-06 05:41:19,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 151 transitions, 2415 flow [2022-12-06 05:41:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 05:41:19,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43125 [2022-12-06 05:41:19,885 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 1499 flow. Second operand 5 states and 69 transitions. [2022-12-06 05:41:19,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 151 transitions, 2415 flow [2022-12-06 05:41:19,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 151 transitions, 2323 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-12-06 05:41:19,898 INFO L231 Difference]: Finished difference. Result has 84 places, 118 transitions, 1970 flow [2022-12-06 05:41:19,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1970, PETRI_PLACES=84, PETRI_TRANSITIONS=118} [2022-12-06 05:41:19,899 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 63 predicate places. [2022-12-06 05:41:19,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:19,899 INFO L89 Accepts]: Start accepts. Operand has 84 places, 118 transitions, 1970 flow [2022-12-06 05:41:19,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:19,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:19,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 118 transitions, 1970 flow [2022-12-06 05:41:19,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 118 transitions, 1970 flow [2022-12-06 05:41:19,928 INFO L130 PetriNetUnfolder]: 93/308 cut-off events. [2022-12-06 05:41:19,928 INFO L131 PetriNetUnfolder]: For 3730/3877 co-relation queries the response was YES. [2022-12-06 05:41:19,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 308 events. 93/308 cut-off events. For 3730/3877 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1761 event pairs, 3 based on Foata normal form. 60/366 useless extension candidates. Maximal degree in co-relation 1756. Up to 95 conditions per place. [2022-12-06 05:41:19,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 118 transitions, 1970 flow [2022-12-06 05:41:19,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 05:41:19,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:19,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:41:19,933 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 118 transitions, 1970 flow [2022-12-06 05:41:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:19,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:19,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:19,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 05:41:19,933 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1977543985, now seen corresponding path program 1 times [2022-12-06 05:41:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:19,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081053407] [2022-12-06 05:41:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:20,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081053407] [2022-12-06 05:41:20,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081053407] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:20,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781292951] [2022-12-06 05:41:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:20,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:20,447 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:20,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 05:41:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:20,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:41:20,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:20,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:20,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:20,685 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 23 treesize of output 7 [2022-12-06 05:41:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:20,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:20,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:20,795 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 86 treesize of output 74 [2022-12-06 05:41:20,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:41:20,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:41:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:20,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781292951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:20,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:41:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126122240] [2022-12-06 05:41:20,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:20,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:41:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:41:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:41:20,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:41:20,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 118 transitions, 1970 flow. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:20,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:20,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:41:20,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:21,370 INFO L130 PetriNetUnfolder]: 361/718 cut-off events. [2022-12-06 05:41:21,371 INFO L131 PetriNetUnfolder]: For 9872/9904 co-relation queries the response was YES. [2022-12-06 05:41:21,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 718 events. 361/718 cut-off events. For 9872/9904 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3683 event pairs, 54 based on Foata normal form. 35/752 useless extension candidates. Maximal degree in co-relation 5157. Up to 581 conditions per place. [2022-12-06 05:41:21,375 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 104 selfloop transitions, 30 changer transitions 35/170 dead transitions. [2022-12-06 05:41:21,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 2693 flow [2022-12-06 05:41:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:41:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:41:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-12-06 05:41:21,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-06 05:41:21,376 INFO L175 Difference]: Start difference. First operand has 80 places, 118 transitions, 1970 flow. Second operand 15 states and 105 transitions. [2022-12-06 05:41:21,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 2693 flow [2022-12-06 05:41:21,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 170 transitions, 2511 flow, removed 85 selfloop flow, removed 2 redundant places. [2022-12-06 05:41:21,395 INFO L231 Difference]: Finished difference. Result has 98 places, 120 transitions, 1961 flow [2022-12-06 05:41:21,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1961, PETRI_PLACES=98, PETRI_TRANSITIONS=120} [2022-12-06 05:41:21,395 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 05:41:21,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:21,395 INFO L89 Accepts]: Start accepts. Operand has 98 places, 120 transitions, 1961 flow [2022-12-06 05:41:21,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:21,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:21,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 120 transitions, 1961 flow [2022-12-06 05:41:21,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 120 transitions, 1961 flow [2022-12-06 05:41:21,424 INFO L130 PetriNetUnfolder]: 92/308 cut-off events. [2022-12-06 05:41:21,424 INFO L131 PetriNetUnfolder]: For 3778/3895 co-relation queries the response was YES. [2022-12-06 05:41:21,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 308 events. 92/308 cut-off events. For 3778/3895 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1775 event pairs, 3 based on Foata normal form. 55/362 useless extension candidates. Maximal degree in co-relation 1669. Up to 86 conditions per place. [2022-12-06 05:41:21,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 120 transitions, 1961 flow [2022-12-06 05:41:21,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 05:41:26,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [678] $Ultimate##0-->L93-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_311| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| 0)) (= (+ |v_#pthreadsForks_178| 1) |v_#pthreadsForks_177|) (= (store |v_#memory_int_491| |v_ULTIMATE.start_main_~#t2~0#1.base_110| (store (select |v_#memory_int_491| |v_ULTIMATE.start_main_~#t2~0#1.base_110|) |v_ULTIMATE.start_main_~#t2~0#1.offset_108| |v_ULTIMATE.start_main_#t~pre14#1_146|)) |v_#memory_int_490|) (= (+ v_~q_back~0_669 1) v_~q_back~0_668) (not (= (ite (and (< v_~q_back~0_669 v_~n~0_346) (<= 0 v_~q_back~0_669)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|) (= |v_ULTIMATE.start_main_#t~pre14#1_146| |v_#pthreadsForks_178|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| (ite (= (select (select |v_#memory_int_491| v_~q~0.base_337) (+ v_~q~0.offset_337 (* v_~q_back~0_669 4))) 1) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_311| (+ v_~N~0_250 1))) InVars {#pthreadsForks=|v_#pthreadsForks_178|, ~q_back~0=v_~q_back~0_669, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_108|, #memory_int=|v_#memory_int_491|, ~N~0=v_~N~0_250, ~q~0.base=v_~q~0.base_337, ~n~0=v_~n~0_346, ~q~0.offset=v_~q~0.offset_337, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_110|} OutVars{~q_back~0=v_~q_back~0_668, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_108|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_207|, ~N~0=v_~N~0_250, ~q~0.base=v_~q~0.base_337, ~q~0.offset=v_~q~0.offset_337, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_146|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_146|, #pthreadsForks=|v_#pthreadsForks_177|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_211|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_207|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_490|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_120|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|, ~n~0=v_~n~0_346, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_110|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:26,586 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:26,586 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:26,586 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:26,586 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:26,764 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:41:26,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5369 [2022-12-06 05:41:26,764 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 120 transitions, 1994 flow [2022-12-06 05:41:26,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:26,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:26,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:26,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:26,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-06 05:41:26,965 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -345913168, now seen corresponding path program 1 times [2022-12-06 05:41:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:26,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144794458] [2022-12-06 05:41:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:27,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144794458] [2022-12-06 05:41:27,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144794458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930530000] [2022-12-06 05:41:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:27,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:27,272 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:27,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 05:41:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:27,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:41:27,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:27,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:27,458 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:41:27,459 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 26 treesize of output 18 [2022-12-06 05:41:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:27,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930530000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:27,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:27,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:41:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767136718] [2022-12-06 05:41:27,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:41:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:41:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:41:27,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 05:41:27,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 120 transitions, 1994 flow. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:27,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:27,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 05:41:27,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:27,762 INFO L130 PetriNetUnfolder]: 333/649 cut-off events. [2022-12-06 05:41:27,762 INFO L131 PetriNetUnfolder]: For 9358/9409 co-relation queries the response was YES. [2022-12-06 05:41:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 649 events. 333/649 cut-off events. For 9358/9409 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3198 event pairs, 27 based on Foata normal form. 64/712 useless extension candidates. Maximal degree in co-relation 4353. Up to 410 conditions per place. [2022-12-06 05:41:27,765 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 85 selfloop transitions, 63 changer transitions 1/150 dead transitions. [2022-12-06 05:41:27,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 150 transitions, 2461 flow [2022-12-06 05:41:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:41:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:41:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-12-06 05:41:27,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32098765432098764 [2022-12-06 05:41:27,766 INFO L175 Difference]: Start difference. First operand has 93 places, 120 transitions, 1994 flow. Second operand 9 states and 78 transitions. [2022-12-06 05:41:27,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 150 transitions, 2461 flow [2022-12-06 05:41:27,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 150 transitions, 2384 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-06 05:41:27,782 INFO L231 Difference]: Finished difference. Result has 95 places, 122 transitions, 2119 flow [2022-12-06 05:41:27,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2119, PETRI_PLACES=95, PETRI_TRANSITIONS=122} [2022-12-06 05:41:27,783 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 74 predicate places. [2022-12-06 05:41:27,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:27,783 INFO L89 Accepts]: Start accepts. Operand has 95 places, 122 transitions, 2119 flow [2022-12-06 05:41:27,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:27,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:27,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 122 transitions, 2119 flow [2022-12-06 05:41:27,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 122 transitions, 2119 flow [2022-12-06 05:41:27,809 INFO L130 PetriNetUnfolder]: 94/307 cut-off events. [2022-12-06 05:41:27,809 INFO L131 PetriNetUnfolder]: For 4248/4376 co-relation queries the response was YES. [2022-12-06 05:41:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 307 events. 94/307 cut-off events. For 4248/4376 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1752 event pairs, 3 based on Foata normal form. 57/363 useless extension candidates. Maximal degree in co-relation 1745. Up to 88 conditions per place. [2022-12-06 05:41:27,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 122 transitions, 2119 flow [2022-12-06 05:41:27,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 05:41:27,812 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:27,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:41:27,812 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 122 transitions, 2119 flow [2022-12-06 05:41:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:27,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:27,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:27,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:28,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-06 05:41:28,017 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2039348344, now seen corresponding path program 1 times [2022-12-06 05:41:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:28,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812207718] [2022-12-06 05:41:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:28,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812207718] [2022-12-06 05:41:28,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812207718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:28,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:28,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:41:28,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993601287] [2022-12-06 05:41:28,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:28,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:41:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:28,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:41:28,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:41:28,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:41:28,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 122 transitions, 2119 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:28,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:28,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:41:28,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:28,665 INFO L130 PetriNetUnfolder]: 404/774 cut-off events. [2022-12-06 05:41:28,666 INFO L131 PetriNetUnfolder]: For 11566/11594 co-relation queries the response was YES. [2022-12-06 05:41:28,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5493 conditions, 774 events. 404/774 cut-off events. For 11566/11594 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3868 event pairs, 60 based on Foata normal form. 36/810 useless extension candidates. Maximal degree in co-relation 5323. Up to 462 conditions per place. [2022-12-06 05:41:28,672 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 109 selfloop transitions, 47 changer transitions 0/157 dead transitions. [2022-12-06 05:41:28,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 157 transitions, 2848 flow [2022-12-06 05:41:28,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 05:41:28,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2022-12-06 05:41:28,673 INFO L175 Difference]: Start difference. First operand has 94 places, 122 transitions, 2119 flow. Second operand 5 states and 54 transitions. [2022-12-06 05:41:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 157 transitions, 2848 flow [2022-12-06 05:41:28,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 2613 flow, removed 39 selfloop flow, removed 9 redundant places. [2022-12-06 05:41:28,698 INFO L231 Difference]: Finished difference. Result has 91 places, 135 transitions, 2297 flow [2022-12-06 05:41:28,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2297, PETRI_PLACES=91, PETRI_TRANSITIONS=135} [2022-12-06 05:41:28,698 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 05:41:28,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:28,698 INFO L89 Accepts]: Start accepts. Operand has 91 places, 135 transitions, 2297 flow [2022-12-06 05:41:28,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:28,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:28,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 135 transitions, 2297 flow [2022-12-06 05:41:28,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 135 transitions, 2297 flow [2022-12-06 05:41:28,729 INFO L130 PetriNetUnfolder]: 113/352 cut-off events. [2022-12-06 05:41:28,729 INFO L131 PetriNetUnfolder]: For 4976/5105 co-relation queries the response was YES. [2022-12-06 05:41:28,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 352 events. 113/352 cut-off events. For 4976/5105 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2047 event pairs, 4 based on Foata normal form. 63/413 useless extension candidates. Maximal degree in co-relation 1912. Up to 104 conditions per place. [2022-12-06 05:41:28,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 135 transitions, 2297 flow [2022-12-06 05:41:28,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 05:41:28,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:41:28,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:28,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:41:28,877 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 135 transitions, 2308 flow [2022-12-06 05:41:28,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:28,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:28,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:28,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 05:41:28,877 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1627661180, now seen corresponding path program 1 times [2022-12-06 05:41:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:28,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747685659] [2022-12-06 05:41:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747685659] [2022-12-06 05:41:29,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747685659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235647475] [2022-12-06 05:41:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:29,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:29,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:29,328 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:29,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 05:41:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:29,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:41:29,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:29,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:29,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:29,555 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 05:41:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:29,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:29,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:29,668 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 82 treesize of output 70 [2022-12-06 05:41:29,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 47 [2022-12-06 05:41:29,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 41 [2022-12-06 05:41:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:29,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235647475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:29,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:29,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:41:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009160931] [2022-12-06 05:41:29,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:29,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:41:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:41:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:41:29,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 05:41:29,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 135 transitions, 2308 flow. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:29,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:29,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 05:41:29,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:30,204 INFO L130 PetriNetUnfolder]: 440/872 cut-off events. [2022-12-06 05:41:30,205 INFO L131 PetriNetUnfolder]: For 12559/12601 co-relation queries the response was YES. [2022-12-06 05:41:30,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 872 events. 440/872 cut-off events. For 12559/12601 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4695 event pairs, 83 based on Foata normal form. 46/918 useless extension candidates. Maximal degree in co-relation 5639. Up to 713 conditions per place. [2022-12-06 05:41:30,209 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 132 selfloop transitions, 34 changer transitions 22/189 dead transitions. [2022-12-06 05:41:30,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 189 transitions, 3060 flow [2022-12-06 05:41:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:41:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:41:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2022-12-06 05:41:30,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31986531986531985 [2022-12-06 05:41:30,210 INFO L175 Difference]: Start difference. First operand has 91 places, 135 transitions, 2308 flow. Second operand 11 states and 95 transitions. [2022-12-06 05:41:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 189 transitions, 3060 flow [2022-12-06 05:41:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 189 transitions, 2971 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 05:41:30,230 INFO L231 Difference]: Finished difference. Result has 106 places, 146 transitions, 2471 flow [2022-12-06 05:41:30,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2471, PETRI_PLACES=106, PETRI_TRANSITIONS=146} [2022-12-06 05:41:30,230 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 85 predicate places. [2022-12-06 05:41:30,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:30,230 INFO L89 Accepts]: Start accepts. Operand has 106 places, 146 transitions, 2471 flow [2022-12-06 05:41:30,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:30,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:30,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 146 transitions, 2471 flow [2022-12-06 05:41:30,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 146 transitions, 2471 flow [2022-12-06 05:41:30,263 INFO L130 PetriNetUnfolder]: 115/376 cut-off events. [2022-12-06 05:41:30,263 INFO L131 PetriNetUnfolder]: For 5495/5675 co-relation queries the response was YES. [2022-12-06 05:41:30,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 376 events. 115/376 cut-off events. For 5495/5675 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2294 event pairs, 6 based on Foata normal form. 77/451 useless extension candidates. Maximal degree in co-relation 2143. Up to 104 conditions per place. [2022-12-06 05:41:30,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 146 transitions, 2471 flow [2022-12-06 05:41:30,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 05:41:30,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:30,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:30,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:30,617 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:41:30,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-06 05:41:30,618 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 145 transitions, 2471 flow [2022-12-06 05:41:30,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:30,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:30,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:30,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-06 05:41:30,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:30,819 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:30,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1251140953, now seen corresponding path program 1 times [2022-12-06 05:41:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:30,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136444007] [2022-12-06 05:41:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:31,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136444007] [2022-12-06 05:41:31,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136444007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:31,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:31,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:41:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159742708] [2022-12-06 05:41:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:31,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:41:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:41:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:41:31,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:41:31,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 145 transitions, 2471 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:41:31,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:31,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:41:31,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:31,306 INFO L130 PetriNetUnfolder]: 450/859 cut-off events. [2022-12-06 05:41:31,307 INFO L131 PetriNetUnfolder]: For 13271/13327 co-relation queries the response was YES. [2022-12-06 05:41:31,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6037 conditions, 859 events. 450/859 cut-off events. For 13271/13327 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4484 event pairs, 92 based on Foata normal form. 52/911 useless extension candidates. Maximal degree in co-relation 5936. Up to 652 conditions per place. [2022-12-06 05:41:31,311 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 118 selfloop transitions, 49 changer transitions 0/168 dead transitions. [2022-12-06 05:41:31,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 168 transitions, 3003 flow [2022-12-06 05:41:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:41:31,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:41:31,311 INFO L175 Difference]: Start difference. First operand has 102 places, 145 transitions, 2471 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:41:31,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 168 transitions, 3003 flow [2022-12-06 05:41:31,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 168 transitions, 2942 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-06 05:41:31,332 INFO L231 Difference]: Finished difference. Result has 101 places, 154 transitions, 2704 flow [2022-12-06 05:41:31,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2704, PETRI_PLACES=101, PETRI_TRANSITIONS=154} [2022-12-06 05:41:31,333 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 05:41:31,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:31,333 INFO L89 Accepts]: Start accepts. Operand has 101 places, 154 transitions, 2704 flow [2022-12-06 05:41:31,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:31,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:31,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 154 transitions, 2704 flow [2022-12-06 05:41:31,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 154 transitions, 2704 flow [2022-12-06 05:41:31,366 INFO L130 PetriNetUnfolder]: 125/390 cut-off events. [2022-12-06 05:41:31,367 INFO L131 PetriNetUnfolder]: For 5732/5876 co-relation queries the response was YES. [2022-12-06 05:41:31,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 390 events. 125/390 cut-off events. For 5732/5876 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2385 event pairs, 5 based on Foata normal form. 64/452 useless extension candidates. Maximal degree in co-relation 2256. Up to 114 conditions per place. [2022-12-06 05:41:31,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 154 transitions, 2704 flow [2022-12-06 05:41:31,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 05:41:31,369 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:31,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 05:41:31,370 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 154 transitions, 2704 flow [2022-12-06 05:41:31,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:41:31,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:31,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:31,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 05:41:31,370 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -64208467, now seen corresponding path program 1 times [2022-12-06 05:41:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:31,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128016240] [2022-12-06 05:41:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128016240] [2022-12-06 05:41:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128016240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143096584] [2022-12-06 05:41:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:31,777 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:31,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 05:41:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:31,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:41:31,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:31,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:32,026 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:41:32,026 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 26 treesize of output 18 [2022-12-06 05:41:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:32,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143096584] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:32,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:32,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 05:41:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455428721] [2022-12-06 05:41:32,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:32,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:41:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:41:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:41:32,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 05:41:32,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 154 transitions, 2704 flow. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:32,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:32,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 05:41:32,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:32,558 INFO L130 PetriNetUnfolder]: 569/1067 cut-off events. [2022-12-06 05:41:32,558 INFO L131 PetriNetUnfolder]: For 17580/17622 co-relation queries the response was YES. [2022-12-06 05:41:32,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7731 conditions, 1067 events. 569/1067 cut-off events. For 17580/17622 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5747 event pairs, 47 based on Foata normal form. 88/1155 useless extension candidates. Maximal degree in co-relation 7465. Up to 413 conditions per place. [2022-12-06 05:41:32,564 INFO L137 encePairwiseOnDemand]: 10/28 looper letters, 135 selfloop transitions, 126 changer transitions 1/263 dead transitions. [2022-12-06 05:41:32,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 263 transitions, 4330 flow [2022-12-06 05:41:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:41:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:41:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-12-06 05:41:32,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30580357142857145 [2022-12-06 05:41:32,565 INFO L175 Difference]: Start difference. First operand has 101 places, 154 transitions, 2704 flow. Second operand 16 states and 137 transitions. [2022-12-06 05:41:32,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 263 transitions, 4330 flow [2022-12-06 05:41:32,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 263 transitions, 4274 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:41:32,598 INFO L231 Difference]: Finished difference. Result has 121 places, 185 transitions, 3636 flow [2022-12-06 05:41:32,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3636, PETRI_PLACES=121, PETRI_TRANSITIONS=185} [2022-12-06 05:41:32,599 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 05:41:32,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:32,599 INFO L89 Accepts]: Start accepts. Operand has 121 places, 185 transitions, 3636 flow [2022-12-06 05:41:32,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:32,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:32,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 185 transitions, 3636 flow [2022-12-06 05:41:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 185 transitions, 3636 flow [2022-12-06 05:41:32,644 INFO L130 PetriNetUnfolder]: 154/481 cut-off events. [2022-12-06 05:41:32,644 INFO L131 PetriNetUnfolder]: For 8690/8846 co-relation queries the response was YES. [2022-12-06 05:41:32,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3139 conditions, 481 events. 154/481 cut-off events. For 8690/8846 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3124 event pairs, 6 based on Foata normal form. 55/535 useless extension candidates. Maximal degree in co-relation 2998. Up to 140 conditions per place. [2022-12-06 05:41:32,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 185 transitions, 3636 flow [2022-12-06 05:41:32,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-06 05:41:32,649 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:32,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 05:41:32,649 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 185 transitions, 3636 flow [2022-12-06 05:41:32,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:32,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:32,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:32,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-06 05:41:32,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:32,854 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 547453371, now seen corresponding path program 1 times [2022-12-06 05:41:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:32,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504347] [2022-12-06 05:41:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504347] [2022-12-06 05:41:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779318065] [2022-12-06 05:41:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:34,042 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:34,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 05:41:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:34,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:41:34,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:34,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:34,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:41:34,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:34,310 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 46 treesize of output 12 [2022-12-06 05:41:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:34,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:34,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:34,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 157 [2022-12-06 05:41:34,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:34,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 94 [2022-12-06 05:41:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:34,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779318065] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:34,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:34,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 05:41:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284664425] [2022-12-06 05:41:34,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:34,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:41:34,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:41:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:41:34,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 05:41:34,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 185 transitions, 3636 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:34,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:34,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 05:41:34,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:36,363 INFO L130 PetriNetUnfolder]: 620/1210 cut-off events. [2022-12-06 05:41:36,363 INFO L131 PetriNetUnfolder]: For 23597/23684 co-relation queries the response was YES. [2022-12-06 05:41:36,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9227 conditions, 1210 events. 620/1210 cut-off events. For 23597/23684 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7100 event pairs, 45 based on Foata normal form. 82/1292 useless extension candidates. Maximal degree in co-relation 8769. Up to 656 conditions per place. [2022-12-06 05:41:36,370 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 138 selfloop transitions, 109 changer transitions 27/275 dead transitions. [2022-12-06 05:41:36,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 275 transitions, 4883 flow [2022-12-06 05:41:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 05:41:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 05:41:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 150 transitions. [2022-12-06 05:41:36,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2435064935064935 [2022-12-06 05:41:36,371 INFO L175 Difference]: Start difference. First operand has 121 places, 185 transitions, 3636 flow. Second operand 22 states and 150 transitions. [2022-12-06 05:41:36,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 275 transitions, 4883 flow [2022-12-06 05:41:36,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 275 transitions, 4517 flow, removed 142 selfloop flow, removed 5 redundant places. [2022-12-06 05:41:36,424 INFO L231 Difference]: Finished difference. Result has 145 places, 203 transitions, 3904 flow [2022-12-06 05:41:36,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3288, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3904, PETRI_PLACES=145, PETRI_TRANSITIONS=203} [2022-12-06 05:41:36,425 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2022-12-06 05:41:36,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:36,425 INFO L89 Accepts]: Start accepts. Operand has 145 places, 203 transitions, 3904 flow [2022-12-06 05:41:36,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:36,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:36,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 203 transitions, 3904 flow [2022-12-06 05:41:36,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 203 transitions, 3904 flow [2022-12-06 05:41:36,476 INFO L130 PetriNetUnfolder]: 158/522 cut-off events. [2022-12-06 05:41:36,476 INFO L131 PetriNetUnfolder]: For 9967/10151 co-relation queries the response was YES. [2022-12-06 05:41:36,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 522 events. 158/522 cut-off events. For 9967/10151 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3590 event pairs, 6 based on Foata normal form. 58/579 useless extension candidates. Maximal degree in co-relation 3377. Up to 140 conditions per place. [2022-12-06 05:41:36,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 203 transitions, 3904 flow [2022-12-06 05:41:36,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-06 05:41:36,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:36,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:36,656 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 05:41:36,726 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:41:36,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-06 05:41:36,726 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 202 transitions, 3901 flow [2022-12-06 05:41:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:36,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:36,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:36,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 05:41:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:36,932 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash -920930931, now seen corresponding path program 2 times [2022-12-06 05:41:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216090624] [2022-12-06 05:41:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216090624] [2022-12-06 05:41:37,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216090624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572752777] [2022-12-06 05:41:37,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:41:37,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:37,979 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:37,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 05:41:38,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:41:38,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:41:38,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 05:41:38,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:38,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:38,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:38,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:38,267 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 12 [2022-12-06 05:41:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:38,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:38,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:38,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 157 [2022-12-06 05:41:38,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:38,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 94 [2022-12-06 05:41:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:38,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572752777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:38,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:38,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 16 [2022-12-06 05:41:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790185849] [2022-12-06 05:41:38,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:38,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:41:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:41:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:41:38,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:41:38,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 202 transitions, 3901 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:38,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:38,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:41:38,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:39,421 INFO L130 PetriNetUnfolder]: 596/1152 cut-off events. [2022-12-06 05:41:39,421 INFO L131 PetriNetUnfolder]: For 23702/23764 co-relation queries the response was YES. [2022-12-06 05:41:39,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9068 conditions, 1152 events. 596/1152 cut-off events. For 23702/23764 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6580 event pairs, 64 based on Foata normal form. 64/1216 useless extension candidates. Maximal degree in co-relation 8933. Up to 727 conditions per place. [2022-12-06 05:41:39,429 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 117 selfloop transitions, 87 changer transitions 19/224 dead transitions. [2022-12-06 05:41:39,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 224 transitions, 4413 flow [2022-12-06 05:41:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:41:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:41:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-12-06 05:41:39,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25483870967741934 [2022-12-06 05:41:39,430 INFO L175 Difference]: Start difference. First operand has 140 places, 202 transitions, 3901 flow. Second operand 10 states and 79 transitions. [2022-12-06 05:41:39,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 224 transitions, 4413 flow [2022-12-06 05:41:39,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 224 transitions, 4255 flow, removed 52 selfloop flow, removed 8 redundant places. [2022-12-06 05:41:39,492 INFO L231 Difference]: Finished difference. Result has 139 places, 192 transitions, 3743 flow [2022-12-06 05:41:39,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3704, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3743, PETRI_PLACES=139, PETRI_TRANSITIONS=192} [2022-12-06 05:41:39,493 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-06 05:41:39,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:39,493 INFO L89 Accepts]: Start accepts. Operand has 139 places, 192 transitions, 3743 flow [2022-12-06 05:41:39,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:39,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:39,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 192 transitions, 3743 flow [2022-12-06 05:41:39,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 192 transitions, 3743 flow [2022-12-06 05:41:39,542 INFO L130 PetriNetUnfolder]: 154/493 cut-off events. [2022-12-06 05:41:39,542 INFO L131 PetriNetUnfolder]: For 9877/10032 co-relation queries the response was YES. [2022-12-06 05:41:39,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 493 events. 154/493 cut-off events. For 9877/10032 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3249 event pairs, 4 based on Foata normal form. 56/549 useless extension candidates. Maximal degree in co-relation 3183. Up to 131 conditions per place. [2022-12-06 05:41:39,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 192 transitions, 3743 flow [2022-12-06 05:41:39,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 05:41:39,547 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:39,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 05:41:39,548 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 192 transitions, 3743 flow [2022-12-06 05:41:39,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:39,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:39,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:39,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:39,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-06 05:41:39,753 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1584945689, now seen corresponding path program 1 times [2022-12-06 05:41:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220591388] [2022-12-06 05:41:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220591388] [2022-12-06 05:41:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220591388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111210252] [2022-12-06 05:41:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:40,161 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:40,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 05:41:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:40,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:41:40,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:40,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:40,412 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 23 treesize of output 7 [2022-12-06 05:41:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:40,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:40,473 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_2301 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~q~0.base) .cse0)) (+ c_~N~0 1))) (forall ((v_ArrVal_2301 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~q~0.base) .cse0)))))) is different from false [2022-12-06 05:41:40,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:40,507 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 86 treesize of output 74 [2022-12-06 05:41:40,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:41:40,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:41:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:40,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111210252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:40,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:40,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:41:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911061849] [2022-12-06 05:41:40,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:40,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:41:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:41:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2022-12-06 05:41:40,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:41:40,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 192 transitions, 3743 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:40,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:40,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:41:40,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:41,227 INFO L130 PetriNetUnfolder]: 579/1121 cut-off events. [2022-12-06 05:41:41,227 INFO L131 PetriNetUnfolder]: For 24485/24521 co-relation queries the response was YES. [2022-12-06 05:41:41,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8945 conditions, 1121 events. 579/1121 cut-off events. For 24485/24521 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6366 event pairs, 95 based on Foata normal form. 33/1154 useless extension candidates. Maximal degree in co-relation 8612. Up to 966 conditions per place. [2022-12-06 05:41:41,234 INFO L137 encePairwiseOnDemand]: 7/30 looper letters, 167 selfloop transitions, 26 changer transitions 30/224 dead transitions. [2022-12-06 05:41:41,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 224 transitions, 4347 flow [2022-12-06 05:41:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:41:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:41:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2022-12-06 05:41:41,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24358974358974358 [2022-12-06 05:41:41,234 INFO L175 Difference]: Start difference. First operand has 137 places, 192 transitions, 3743 flow. Second operand 13 states and 95 transitions. [2022-12-06 05:41:41,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 224 transitions, 4347 flow [2022-12-06 05:41:41,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 224 transitions, 4221 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-06 05:41:41,284 INFO L231 Difference]: Finished difference. Result has 143 places, 183 transitions, 3490 flow [2022-12-06 05:41:41,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3615, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3490, PETRI_PLACES=143, PETRI_TRANSITIONS=183} [2022-12-06 05:41:41,284 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 122 predicate places. [2022-12-06 05:41:41,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:41,285 INFO L89 Accepts]: Start accepts. Operand has 143 places, 183 transitions, 3490 flow [2022-12-06 05:41:41,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:41,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:41,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 183 transitions, 3490 flow [2022-12-06 05:41:41,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 183 transitions, 3490 flow [2022-12-06 05:41:41,329 INFO L130 PetriNetUnfolder]: 151/458 cut-off events. [2022-12-06 05:41:41,329 INFO L131 PetriNetUnfolder]: For 9284/9449 co-relation queries the response was YES. [2022-12-06 05:41:41,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 458 events. 151/458 cut-off events. For 9284/9449 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2848 event pairs, 2 based on Foata normal form. 48/506 useless extension candidates. Maximal degree in co-relation 3083. Up to 126 conditions per place. [2022-12-06 05:41:41,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 183 transitions, 3490 flow [2022-12-06 05:41:41,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 05:41:41,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:41,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 05:41:41,333 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 183 transitions, 3490 flow [2022-12-06 05:41:41,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:41,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:41,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:41,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:41,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-06 05:41:41,538 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1138429760, now seen corresponding path program 1 times [2022-12-06 05:41:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:41,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262174390] [2022-12-06 05:41:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:42,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262174390] [2022-12-06 05:41:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262174390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419469710] [2022-12-06 05:41:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:42,169 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:42,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 05:41:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:42,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 05:41:42,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:42,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:42,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:41:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:42,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:42,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:42,453 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 42 [2022-12-06 05:41:42,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:41:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:42,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419469710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:42,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:42,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 05:41:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411157390] [2022-12-06 05:41:42,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:42,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:41:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:41:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2022-12-06 05:41:42,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:41:42,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 183 transitions, 3490 flow. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:42,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:42,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:41:42,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:42,891 INFO L130 PetriNetUnfolder]: 590/1095 cut-off events. [2022-12-06 05:41:42,892 INFO L131 PetriNetUnfolder]: For 24193/24231 co-relation queries the response was YES. [2022-12-06 05:41:42,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9033 conditions, 1095 events. 590/1095 cut-off events. For 24193/24231 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5835 event pairs, 88 based on Foata normal form. 49/1144 useless extension candidates. Maximal degree in co-relation 8925. Up to 818 conditions per place. [2022-12-06 05:41:42,898 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 161 selfloop transitions, 53 changer transitions 0/215 dead transitions. [2022-12-06 05:41:42,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 215 transitions, 4325 flow [2022-12-06 05:41:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:41:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:41:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 05:41:42,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 05:41:42,899 INFO L175 Difference]: Start difference. First operand has 132 places, 183 transitions, 3490 flow. Second operand 7 states and 66 transitions. [2022-12-06 05:41:42,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 215 transitions, 4325 flow [2022-12-06 05:41:42,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 215 transitions, 4165 flow, removed 60 selfloop flow, removed 10 redundant places. [2022-12-06 05:41:42,954 INFO L231 Difference]: Finished difference. Result has 130 places, 192 transitions, 3718 flow [2022-12-06 05:41:42,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3718, PETRI_PLACES=130, PETRI_TRANSITIONS=192} [2022-12-06 05:41:42,955 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-06 05:41:42,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:42,955 INFO L89 Accepts]: Start accepts. Operand has 130 places, 192 transitions, 3718 flow [2022-12-06 05:41:42,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:42,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:42,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 192 transitions, 3718 flow [2022-12-06 05:41:42,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 192 transitions, 3718 flow [2022-12-06 05:41:43,003 INFO L130 PetriNetUnfolder]: 159/480 cut-off events. [2022-12-06 05:41:43,003 INFO L131 PetriNetUnfolder]: For 10551/10717 co-relation queries the response was YES. [2022-12-06 05:41:43,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 480 events. 159/480 cut-off events. For 10551/10717 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3030 event pairs, 1 based on Foata normal form. 59/538 useless extension candidates. Maximal degree in co-relation 3147. Up to 133 conditions per place. [2022-12-06 05:41:43,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 192 transitions, 3718 flow [2022-12-06 05:41:43,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 05:41:43,029 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,030 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,030 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,030 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:43,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 05:41:43,198 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 192 transitions, 3741 flow [2022-12-06 05:41:43,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:43,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:43,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:43,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-06 05:41:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-06 05:41:43,399 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1053446931, now seen corresponding path program 1 times [2022-12-06 05:41:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125181653] [2022-12-06 05:41:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:43,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125181653] [2022-12-06 05:41:43,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125181653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:43,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449900513] [2022-12-06 05:41:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:43,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:43,975 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:43,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 05:41:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:44,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:41:44,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:44,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:44,209 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 05:41:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:41:44,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:44,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:44,325 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 86 treesize of output 74 [2022-12-06 05:41:44,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-12-06 05:41:44,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 45 [2022-12-06 05:41:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:41:44,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449900513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:44,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:44,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 05:41:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136113748] [2022-12-06 05:41:44,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:41:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:41:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:41:44,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:41:44,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 192 transitions, 3741 flow. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:44,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:44,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:41:44,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:44,979 INFO L130 PetriNetUnfolder]: 608/1156 cut-off events. [2022-12-06 05:41:44,979 INFO L131 PetriNetUnfolder]: For 25765/25823 co-relation queries the response was YES. [2022-12-06 05:41:44,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9380 conditions, 1156 events. 608/1156 cut-off events. For 25765/25823 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6395 event pairs, 109 based on Foata normal form. 32/1188 useless extension candidates. Maximal degree in co-relation 8750. Up to 1017 conditions per place. [2022-12-06 05:41:44,985 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 173 selfloop transitions, 44 changer transitions 18/236 dead transitions. [2022-12-06 05:41:44,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 236 transitions, 4577 flow [2022-12-06 05:41:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:41:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:41:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-12-06 05:41:44,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22365591397849463 [2022-12-06 05:41:44,986 INFO L175 Difference]: Start difference. First operand has 130 places, 192 transitions, 3741 flow. Second operand 15 states and 104 transitions. [2022-12-06 05:41:44,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 236 transitions, 4577 flow [2022-12-06 05:41:45,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 236 transitions, 4494 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 05:41:45,045 INFO L231 Difference]: Finished difference. Result has 146 places, 200 transitions, 3919 flow [2022-12-06 05:41:45,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3660, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3919, PETRI_PLACES=146, PETRI_TRANSITIONS=200} [2022-12-06 05:41:45,046 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-06 05:41:45,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:45,046 INFO L89 Accepts]: Start accepts. Operand has 146 places, 200 transitions, 3919 flow [2022-12-06 05:41:45,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:45,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:45,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 200 transitions, 3919 flow [2022-12-06 05:41:45,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 200 transitions, 3919 flow [2022-12-06 05:41:45,129 INFO L130 PetriNetUnfolder]: 163/501 cut-off events. [2022-12-06 05:41:45,129 INFO L131 PetriNetUnfolder]: For 10935/11088 co-relation queries the response was YES. [2022-12-06 05:41:45,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 501 events. 163/501 cut-off events. For 10935/11088 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3248 event pairs, 1 based on Foata normal form. 53/553 useless extension candidates. Maximal degree in co-relation 3379. Up to 133 conditions per place. [2022-12-06 05:41:45,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 200 transitions, 3919 flow [2022-12-06 05:41:45,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-06 05:41:45,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:45,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:41:45,470 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:45,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-06 05:41:45,470 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 198 transitions, 3899 flow [2022-12-06 05:41:45,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:45,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:45,470 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:45,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-06 05:41:45,671 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1388796278, now seen corresponding path program 2 times [2022-12-06 05:41:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348489406] [2022-12-06 05:41:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:46,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348489406] [2022-12-06 05:41:46,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348489406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:46,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889929895] [2022-12-06 05:41:46,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:41:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:46,470 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:46,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 05:41:46,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:41:46,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:41:46,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:41:46,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:46,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:46,772 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 12 [2022-12-06 05:41:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:46,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:46,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:46,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 76 [2022-12-06 05:41:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:46,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889929895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:46,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:46,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-06 05:41:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779437105] [2022-12-06 05:41:46,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:46,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:41:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:41:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:41:46,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:41:46,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 198 transitions, 3899 flow. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:46,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:46,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:41:46,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:47,471 INFO L130 PetriNetUnfolder]: 618/1172 cut-off events. [2022-12-06 05:41:47,471 INFO L131 PetriNetUnfolder]: For 27018/27085 co-relation queries the response was YES. [2022-12-06 05:41:47,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 1172 events. 618/1172 cut-off events. For 27018/27085 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6533 event pairs, 122 based on Foata normal form. 47/1219 useless extension candidates. Maximal degree in co-relation 9516. Up to 1044 conditions per place. [2022-12-06 05:41:47,481 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 206 selfloop transitions, 34 changer transitions 4/245 dead transitions. [2022-12-06 05:41:47,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 245 transitions, 4806 flow [2022-12-06 05:41:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:41:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:41:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 05:41:47,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2426470588235294 [2022-12-06 05:41:47,482 INFO L175 Difference]: Start difference. First operand has 141 places, 198 transitions, 3899 flow. Second operand 12 states and 99 transitions. [2022-12-06 05:41:47,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 245 transitions, 4806 flow [2022-12-06 05:41:47,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 245 transitions, 4684 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-06 05:41:47,555 INFO L231 Difference]: Finished difference. Result has 150 places, 211 transitions, 4141 flow [2022-12-06 05:41:47,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3777, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4141, PETRI_PLACES=150, PETRI_TRANSITIONS=211} [2022-12-06 05:41:47,555 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2022-12-06 05:41:47,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:47,556 INFO L89 Accepts]: Start accepts. Operand has 150 places, 211 transitions, 4141 flow [2022-12-06 05:41:47,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:47,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:47,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 211 transitions, 4141 flow [2022-12-06 05:41:47,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 211 transitions, 4141 flow [2022-12-06 05:41:47,613 INFO L130 PetriNetUnfolder]: 166/527 cut-off events. [2022-12-06 05:41:47,613 INFO L131 PetriNetUnfolder]: For 11911/12084 co-relation queries the response was YES. [2022-12-06 05:41:47,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 527 events. 166/527 cut-off events. For 11911/12084 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3545 event pairs, 4 based on Foata normal form. 54/578 useless extension candidates. Maximal degree in co-relation 3542. Up to 142 conditions per place. [2022-12-06 05:41:47,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 211 transitions, 4141 flow [2022-12-06 05:41:47,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 05:41:47,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:47,718 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:47,719 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:48,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_676| v_~q~0.base_453))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_465| 2) (= |v_ULTIMATE.start_main_#t~pre14#1_206| |v_#pthreadsForks_272|) (= v_~q_back~0_902 (+ 2 v_~q_back~0_903)) (= (+ |v_#pthreadsForks_272| 1) |v_#pthreadsForks_271|) (= (store |v_#memory_int_676| |v_ULTIMATE.start_main_~#t2~0#1.base_145| (store (select |v_#memory_int_676| |v_ULTIMATE.start_main_~#t2~0#1.base_145|) |v_ULTIMATE.start_main_~#t2~0#1.offset_142| |v_ULTIMATE.start_main_#t~pre14#1_206|)) |v_#memory_int_675|) (not (= (ite (and (<= 0 v_~q_back~0_903) (< v_~q_back~0_903 v_~n~0_446)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_903 4) v_~q~0.offset_453)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_465| (+ v_~N~0_342 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_435| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_435| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_453 (* v_~q_back~0_902 4))) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_435| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_435|) (not (= (ite (and (<= 1 v_~q_back~0_902) (< v_~q_back~0_902 (+ v_~n~0_446 1))) 1 0) 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_272|, ~q_back~0=v_~q_back~0_903, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, #memory_int=|v_#memory_int_676|, ~N~0=v_~N~0_342, ~q~0.base=v_~q~0.base_453, ~n~0=v_~n~0_446, ~q~0.offset=v_~q~0.offset_453, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_145|} OutVars{~q_back~0=v_~q_back~0_902, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_301|, ~N~0=v_~N~0_342, ~q~0.base=v_~q~0.base_453, ~q~0.offset=v_~q~0.offset_453, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_435|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_206|, #pthreadsForks=|v_#pthreadsForks_271|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_305|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_301|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_465|, #memory_int=|v_#memory_int_675|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_167|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_435|, ~n~0=v_~n~0_446, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_145|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:41:48,409 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,409 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,488 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,489 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,647 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,647 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:48,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:48,950 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 05:41:48,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1394 [2022-12-06 05:41:48,950 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 206 transitions, 4157 flow [2022-12-06 05:41:48,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:48,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:48,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:48,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:49,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:49,157 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1912719518, now seen corresponding path program 1 times [2022-12-06 05:41:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:49,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189879854] [2022-12-06 05:41:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:49,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189879854] [2022-12-06 05:41:49,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189879854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:49,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:49,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:41:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371890814] [2022-12-06 05:41:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:49,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:41:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:41:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:41:49,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 05:41:49,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 206 transitions, 4157 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:49,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:49,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 05:41:49,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:49,816 INFO L130 PetriNetUnfolder]: 673/1258 cut-off events. [2022-12-06 05:41:49,816 INFO L131 PetriNetUnfolder]: For 31889/31984 co-relation queries the response was YES. [2022-12-06 05:41:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10550 conditions, 1258 events. 673/1258 cut-off events. For 31889/31984 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6922 event pairs, 84 based on Foata normal form. 47/1305 useless extension candidates. Maximal degree in co-relation 10247. Up to 812 conditions per place. [2022-12-06 05:41:49,824 INFO L137 encePairwiseOnDemand]: 13/41 looper letters, 161 selfloop transitions, 82 changer transitions 0/244 dead transitions. [2022-12-06 05:41:49,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 5223 flow [2022-12-06 05:41:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:41:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:41:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 05:41:49,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3463414634146341 [2022-12-06 05:41:49,825 INFO L175 Difference]: Start difference. First operand has 145 places, 206 transitions, 4157 flow. Second operand 5 states and 71 transitions. [2022-12-06 05:41:49,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 5223 flow [2022-12-06 05:41:49,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 244 transitions, 4967 flow, removed 101 selfloop flow, removed 8 redundant places. [2022-12-06 05:41:49,897 INFO L231 Difference]: Finished difference. Result has 142 places, 221 transitions, 4538 flow [2022-12-06 05:41:49,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3964, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4538, PETRI_PLACES=142, PETRI_TRANSITIONS=221} [2022-12-06 05:41:49,898 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2022-12-06 05:41:49,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:49,898 INFO L89 Accepts]: Start accepts. Operand has 142 places, 221 transitions, 4538 flow [2022-12-06 05:41:49,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:49,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:49,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 221 transitions, 4538 flow [2022-12-06 05:41:49,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 221 transitions, 4538 flow [2022-12-06 05:41:49,971 INFO L130 PetriNetUnfolder]: 186/572 cut-off events. [2022-12-06 05:41:49,971 INFO L131 PetriNetUnfolder]: For 13663/13863 co-relation queries the response was YES. [2022-12-06 05:41:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4030 conditions, 572 events. 186/572 cut-off events. For 13663/13863 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3824 event pairs, 1 based on Foata normal form. 61/632 useless extension candidates. Maximal degree in co-relation 3864. Up to 158 conditions per place. [2022-12-06 05:41:49,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 221 transitions, 4538 flow [2022-12-06 05:41:49,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-06 05:41:49,975 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:49,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 05:41:49,976 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 221 transitions, 4538 flow [2022-12-06 05:41:49,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:49,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:49,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:49,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 05:41:49,976 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:49,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2091123038, now seen corresponding path program 1 times [2022-12-06 05:41:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:49,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708388594] [2022-12-06 05:41:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:50,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:50,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708388594] [2022-12-06 05:41:50,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708388594] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:50,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877223350] [2022-12-06 05:41:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:50,053 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:50,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 05:41:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:50,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:41:50,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:50,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:41:50,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877223350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:50,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:41:50,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-06 05:41:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040167384] [2022-12-06 05:41:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:50,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:41:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:41:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:41:50,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 05:41:50,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 221 transitions, 4538 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:50,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:50,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 05:41:50,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:50,522 INFO L130 PetriNetUnfolder]: 749/1394 cut-off events. [2022-12-06 05:41:50,522 INFO L131 PetriNetUnfolder]: For 36438/36559 co-relation queries the response was YES. [2022-12-06 05:41:50,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11776 conditions, 1394 events. 749/1394 cut-off events. For 36438/36559 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7975 event pairs, 65 based on Foata normal form. 63/1457 useless extension candidates. Maximal degree in co-relation 11376. Up to 1120 conditions per place. [2022-12-06 05:41:50,531 INFO L137 encePairwiseOnDemand]: 20/41 looper letters, 201 selfloop transitions, 51 changer transitions 4/257 dead transitions. [2022-12-06 05:41:50,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 257 transitions, 5624 flow [2022-12-06 05:41:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:41:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:41:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 05:41:50,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2022-12-06 05:41:50,532 INFO L175 Difference]: Start difference. First operand has 142 places, 221 transitions, 4538 flow. Second operand 4 states and 62 transitions. [2022-12-06 05:41:50,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 257 transitions, 5624 flow [2022-12-06 05:41:50,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 257 transitions, 5509 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:50,610 INFO L231 Difference]: Finished difference. Result has 144 places, 231 transitions, 4799 flow [2022-12-06 05:41:50,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4431, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4799, PETRI_PLACES=144, PETRI_TRANSITIONS=231} [2022-12-06 05:41:50,611 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-06 05:41:50,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:50,611 INFO L89 Accepts]: Start accepts. Operand has 144 places, 231 transitions, 4799 flow [2022-12-06 05:41:50,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:50,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:50,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 231 transitions, 4799 flow [2022-12-06 05:41:50,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 231 transitions, 4799 flow [2022-12-06 05:41:50,684 INFO L130 PetriNetUnfolder]: 207/623 cut-off events. [2022-12-06 05:41:50,684 INFO L131 PetriNetUnfolder]: For 15343/15531 co-relation queries the response was YES. [2022-12-06 05:41:50,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4622 conditions, 623 events. 207/623 cut-off events. For 15343/15531 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4279 event pairs, 3 based on Foata normal form. 76/696 useless extension candidates. Maximal degree in co-relation 4513. Up to 182 conditions per place. [2022-12-06 05:41:50,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 231 transitions, 4799 flow [2022-12-06 05:41:50,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 05:41:50,690 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:50,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 05:41:50,690 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 231 transitions, 4799 flow [2022-12-06 05:41:50,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:50,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:50,691 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:50,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:50,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-12-06 05:41:50,891 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 822059515, now seen corresponding path program 1 times [2022-12-06 05:41:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:50,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779020331] [2022-12-06 05:41:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779020331] [2022-12-06 05:41:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779020331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496545119] [2022-12-06 05:41:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:51,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:51,655 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:51,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 05:41:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:51,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:41:51,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:51,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:51,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:41:51,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:51,954 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 12 [2022-12-06 05:41:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:51,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:52,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:52,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 136 [2022-12-06 05:41:52,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:52,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 62 [2022-12-06 05:41:52,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:52,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 49 [2022-12-06 05:41:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:52,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496545119] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:52,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:52,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:41:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820324658] [2022-12-06 05:41:52,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:52,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:41:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:41:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:41:52,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:41:52,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 231 transitions, 4799 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:52,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:52,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:41:52,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:52,676 INFO L130 PetriNetUnfolder]: 750/1392 cut-off events. [2022-12-06 05:41:52,676 INFO L131 PetriNetUnfolder]: For 36863/36909 co-relation queries the response was YES. [2022-12-06 05:41:52,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12214 conditions, 1392 events. 750/1392 cut-off events. For 36863/36909 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7865 event pairs, 211 based on Foata normal form. 15/1406 useless extension candidates. Maximal degree in co-relation 11978. Up to 1307 conditions per place. [2022-12-06 05:41:52,686 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 228 selfloop transitions, 20 changer transitions 2/251 dead transitions. [2022-12-06 05:41:52,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 251 transitions, 5481 flow [2022-12-06 05:41:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:41:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:41:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-06 05:41:52,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2454212454212454 [2022-12-06 05:41:52,687 INFO L175 Difference]: Start difference. First operand has 143 places, 231 transitions, 4799 flow. Second operand 7 states and 67 transitions. [2022-12-06 05:41:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 251 transitions, 5481 flow [2022-12-06 05:41:52,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 251 transitions, 5372 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 05:41:52,777 INFO L231 Difference]: Finished difference. Result has 148 places, 235 transitions, 4843 flow [2022-12-06 05:41:52,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4694, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4843, PETRI_PLACES=148, PETRI_TRANSITIONS=235} [2022-12-06 05:41:52,778 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-06 05:41:52,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:52,778 INFO L89 Accepts]: Start accepts. Operand has 148 places, 235 transitions, 4843 flow [2022-12-06 05:41:52,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:52,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:52,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 235 transitions, 4843 flow [2022-12-06 05:41:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 235 transitions, 4843 flow [2022-12-06 05:41:52,850 INFO L130 PetriNetUnfolder]: 210/625 cut-off events. [2022-12-06 05:41:52,851 INFO L131 PetriNetUnfolder]: For 14667/14836 co-relation queries the response was YES. [2022-12-06 05:41:52,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4576 conditions, 625 events. 210/625 cut-off events. For 14667/14836 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4242 event pairs, 4 based on Foata normal form. 63/684 useless extension candidates. Maximal degree in co-relation 4405. Up to 184 conditions per place. [2022-12-06 05:41:52,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 235 transitions, 4843 flow [2022-12-06 05:41:52,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 05:41:52,861 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:52,861 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:52,943 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:52,943 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:53,036 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:53,037 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:53,212 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:53,212 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:58,396 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:58,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5618 [2022-12-06 05:41:58,396 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 233 transitions, 4836 flow [2022-12-06 05:41:58,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:58,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:58,396 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:58,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:58,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:58,597 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash 439665934, now seen corresponding path program 1 times [2022-12-06 05:41:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:58,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154357920] [2022-12-06 05:41:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:00,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:00,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154357920] [2022-12-06 05:42:00,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154357920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:00,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813103255] [2022-12-06 05:42:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:00,111 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:00,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 05:42:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:00,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 05:42:00,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:00,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:00,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:42:00,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:00,432 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 59 treesize of output 16 [2022-12-06 05:42:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:00,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:00,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:00,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 179 [2022-12-06 05:42:00,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:00,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 103 treesize of output 64 [2022-12-06 05:42:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:00,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813103255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:00,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:00,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:42:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362726000] [2022-12-06 05:42:00,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:00,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:42:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:42:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:42:00,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 05:42:00,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 233 transitions, 4836 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:00,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:00,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 05:42:00,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:01,779 INFO L130 PetriNetUnfolder]: 837/1593 cut-off events. [2022-12-06 05:42:01,779 INFO L131 PetriNetUnfolder]: For 39135/39182 co-relation queries the response was YES. [2022-12-06 05:42:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13745 conditions, 1593 events. 837/1593 cut-off events. For 39135/39182 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9592 event pairs, 113 based on Foata normal form. 38/1631 useless extension candidates. Maximal degree in co-relation 13333. Up to 1239 conditions per place. [2022-12-06 05:42:01,792 INFO L137 encePairwiseOnDemand]: 11/41 looper letters, 232 selfloop transitions, 85 changer transitions 25/343 dead transitions. [2022-12-06 05:42:01,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 343 transitions, 6794 flow [2022-12-06 05:42:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:42:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:42:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 166 transitions. [2022-12-06 05:42:01,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20243902439024392 [2022-12-06 05:42:01,793 INFO L175 Difference]: Start difference. First operand has 146 places, 233 transitions, 4836 flow. Second operand 20 states and 166 transitions. [2022-12-06 05:42:01,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 343 transitions, 6794 flow [2022-12-06 05:42:01,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 343 transitions, 6678 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-12-06 05:42:01,909 INFO L231 Difference]: Finished difference. Result has 169 places, 267 transitions, 5693 flow [2022-12-06 05:42:01,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4730, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5693, PETRI_PLACES=169, PETRI_TRANSITIONS=267} [2022-12-06 05:42:01,910 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 148 predicate places. [2022-12-06 05:42:01,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:01,910 INFO L89 Accepts]: Start accepts. Operand has 169 places, 267 transitions, 5693 flow [2022-12-06 05:42:01,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:01,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:01,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 267 transitions, 5693 flow [2022-12-06 05:42:01,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 267 transitions, 5693 flow [2022-12-06 05:42:02,004 INFO L130 PetriNetUnfolder]: 219/684 cut-off events. [2022-12-06 05:42:02,004 INFO L131 PetriNetUnfolder]: For 17734/17944 co-relation queries the response was YES. [2022-12-06 05:42:02,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 684 events. 219/684 cut-off events. For 17734/17944 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4885 event pairs, 8 based on Foata normal form. 81/761 useless extension candidates. Maximal degree in co-relation 5047. Up to 192 conditions per place. [2022-12-06 05:42:02,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 267 transitions, 5693 flow [2022-12-06 05:42:02,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 844 [2022-12-06 05:42:02,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:02,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L95-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (not (= v_~N~0_In_9 v_~s~0_In_6)) 1 0))) InVars {~N~0=v_~N~0_In_9, ~s~0=v_~s~0_In_6} OutVars{~N~0=v_~N~0_In_9, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|, ~s~0=v_~s~0_In_6} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:02,235 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:02,235 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:02,235 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:02,235 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:02,236 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:02,236 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:02,520 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:42:02,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 611 [2022-12-06 05:42:02,521 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 266 transitions, 5702 flow [2022-12-06 05:42:02,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:02,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:02,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:02,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-06 05:42:02,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-12-06 05:42:02,721 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1746151609, now seen corresponding path program 1 times [2022-12-06 05:42:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:02,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774936373] [2022-12-06 05:42:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:02,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774936373] [2022-12-06 05:42:02,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774936373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:02,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:02,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593093042] [2022-12-06 05:42:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:02,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:02,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:02,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:42:02,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 266 transitions, 5702 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:02,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:02,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:42:02,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:03,076 INFO L130 PetriNetUnfolder]: 798/1518 cut-off events. [2022-12-06 05:42:03,076 INFO L131 PetriNetUnfolder]: For 42506/42594 co-relation queries the response was YES. [2022-12-06 05:42:03,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13495 conditions, 1518 events. 798/1518 cut-off events. For 42506/42594 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9020 event pairs, 83 based on Foata normal form. 70/1588 useless extension candidates. Maximal degree in co-relation 13103. Up to 1266 conditions per place. [2022-12-06 05:42:03,087 INFO L137 encePairwiseOnDemand]: 21/43 looper letters, 221 selfloop transitions, 59 changer transitions 6/287 dead transitions. [2022-12-06 05:42:03,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 287 transitions, 6559 flow [2022-12-06 05:42:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 05:42:03,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36627906976744184 [2022-12-06 05:42:03,088 INFO L175 Difference]: Start difference. First operand has 165 places, 266 transitions, 5702 flow. Second operand 4 states and 63 transitions. [2022-12-06 05:42:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 287 transitions, 6559 flow [2022-12-06 05:42:03,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 287 transitions, 6319 flow, removed 102 selfloop flow, removed 5 redundant places. [2022-12-06 05:42:03,203 INFO L231 Difference]: Finished difference. Result has 164 places, 261 transitions, 5467 flow [2022-12-06 05:42:03,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5434, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5467, PETRI_PLACES=164, PETRI_TRANSITIONS=261} [2022-12-06 05:42:03,203 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2022-12-06 05:42:03,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:03,203 INFO L89 Accepts]: Start accepts. Operand has 164 places, 261 transitions, 5467 flow [2022-12-06 05:42:03,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:03,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:03,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 261 transitions, 5467 flow [2022-12-06 05:42:03,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 261 transitions, 5467 flow [2022-12-06 05:42:03,278 INFO L130 PetriNetUnfolder]: 212/666 cut-off events. [2022-12-06 05:42:03,278 INFO L131 PetriNetUnfolder]: For 17122/17311 co-relation queries the response was YES. [2022-12-06 05:42:03,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 666 events. 212/666 cut-off events. For 17122/17311 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4754 event pairs, 8 based on Foata normal form. 82/744 useless extension candidates. Maximal degree in co-relation 4958. Up to 189 conditions per place. [2022-12-06 05:42:03,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 261 transitions, 5467 flow [2022-12-06 05:42:03,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-06 05:42:03,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:03,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 05:42:03,285 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 261 transitions, 5467 flow [2022-12-06 05:42:03,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:03,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:03,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:03,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 05:42:03,285 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1254106397, now seen corresponding path program 1 times [2022-12-06 05:42:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:03,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663408127] [2022-12-06 05:42:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:04,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:04,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663408127] [2022-12-06 05:42:04,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663408127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:04,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:04,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:42:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005705177] [2022-12-06 05:42:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:04,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:42:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:42:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:42:04,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:42:04,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 261 transitions, 5467 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 05:42:04,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:04,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:42:04,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:05,146 INFO L130 PetriNetUnfolder]: 791/1491 cut-off events. [2022-12-06 05:42:05,146 INFO L131 PetriNetUnfolder]: For 40928/41018 co-relation queries the response was YES. [2022-12-06 05:42:05,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13248 conditions, 1491 events. 791/1491 cut-off events. For 40928/41018 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8749 event pairs, 192 based on Foata normal form. 41/1532 useless extension candidates. Maximal degree in co-relation 13019. Up to 1431 conditions per place. [2022-12-06 05:42:05,157 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 248 selfloop transitions, 18 changer transitions 5/272 dead transitions. [2022-12-06 05:42:05,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 272 transitions, 6045 flow [2022-12-06 05:42:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:42:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:42:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 05:42:05,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2022-12-06 05:42:05,158 INFO L175 Difference]: Start difference. First operand has 163 places, 261 transitions, 5467 flow. Second operand 6 states and 60 transitions. [2022-12-06 05:42:05,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 272 transitions, 6045 flow [2022-12-06 05:42:05,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 272 transitions, 5882 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 05:42:05,313 INFO L231 Difference]: Finished difference. Result has 164 places, 260 transitions, 5315 flow [2022-12-06 05:42:05,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5304, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5315, PETRI_PLACES=164, PETRI_TRANSITIONS=260} [2022-12-06 05:42:05,332 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2022-12-06 05:42:05,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:05,332 INFO L89 Accepts]: Start accepts. Operand has 164 places, 260 transitions, 5315 flow [2022-12-06 05:42:05,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:05,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:05,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 260 transitions, 5315 flow [2022-12-06 05:42:05,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 260 transitions, 5315 flow [2022-12-06 05:42:05,428 INFO L130 PetriNetUnfolder]: 214/657 cut-off events. [2022-12-06 05:42:05,429 INFO L131 PetriNetUnfolder]: For 16319/16509 co-relation queries the response was YES. [2022-12-06 05:42:05,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4920 conditions, 657 events. 214/657 cut-off events. For 16319/16509 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4624 event pairs, 8 based on Foata normal form. 79/732 useless extension candidates. Maximal degree in co-relation 4848. Up to 190 conditions per place. [2022-12-06 05:42:05,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 260 transitions, 5315 flow [2022-12-06 05:42:05,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 05:42:05,435 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:05,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 05:42:05,435 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 260 transitions, 5315 flow [2022-12-06 05:42:05,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 05:42:05,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:05,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:05,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 05:42:05,436 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 828957235, now seen corresponding path program 1 times [2022-12-06 05:42:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:05,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226304821] [2022-12-06 05:42:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226304821] [2022-12-06 05:42:05,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226304821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:05,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25344630] [2022-12-06 05:42:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:05,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:05,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:05,972 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:05,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 05:42:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:06,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:42:06,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:06,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:06,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:42:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:06,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:06,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:06,273 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 42 [2022-12-06 05:42:06,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:42:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:06,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25344630] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:06,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:06,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 05:42:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407438606] [2022-12-06 05:42:06,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:06,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:42:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:42:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2022-12-06 05:42:06,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:42:06,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 260 transitions, 5315 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:06,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:06,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:42:06,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:07,045 INFO L130 PetriNetUnfolder]: 830/1554 cut-off events. [2022-12-06 05:42:07,045 INFO L131 PetriNetUnfolder]: For 40787/40852 co-relation queries the response was YES. [2022-12-06 05:42:07,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13570 conditions, 1554 events. 830/1554 cut-off events. For 40787/40852 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9007 event pairs, 87 based on Foata normal form. 73/1627 useless extension candidates. Maximal degree in co-relation 13495. Up to 1056 conditions per place. [2022-12-06 05:42:07,058 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 205 selfloop transitions, 93 changer transitions 0/299 dead transitions. [2022-12-06 05:42:07,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 299 transitions, 6445 flow [2022-12-06 05:42:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:42:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:42:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-06 05:42:07,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29343629343629346 [2022-12-06 05:42:07,059 INFO L175 Difference]: Start difference. First operand has 163 places, 260 transitions, 5315 flow. Second operand 7 states and 76 transitions. [2022-12-06 05:42:07,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 299 transitions, 6445 flow [2022-12-06 05:42:07,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 299 transitions, 6407 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:42:07,191 INFO L231 Difference]: Finished difference. Result has 166 places, 271 transitions, 5806 flow [2022-12-06 05:42:07,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5277, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5806, PETRI_PLACES=166, PETRI_TRANSITIONS=271} [2022-12-06 05:42:07,192 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 145 predicate places. [2022-12-06 05:42:07,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:07,192 INFO L89 Accepts]: Start accepts. Operand has 166 places, 271 transitions, 5806 flow [2022-12-06 05:42:07,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:07,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:07,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 271 transitions, 5806 flow [2022-12-06 05:42:07,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 271 transitions, 5806 flow [2022-12-06 05:42:07,297 INFO L130 PetriNetUnfolder]: 222/687 cut-off events. [2022-12-06 05:42:07,297 INFO L131 PetriNetUnfolder]: For 18432/18625 co-relation queries the response was YES. [2022-12-06 05:42:07,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 687 events. 222/687 cut-off events. For 18432/18625 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4893 event pairs, 8 based on Foata normal form. 82/765 useless extension candidates. Maximal degree in co-relation 5074. Up to 198 conditions per place. [2022-12-06 05:42:07,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 271 transitions, 5806 flow [2022-12-06 05:42:07,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 874 [2022-12-06 05:42:07,305 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:07,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 05:42:07,306 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 271 transitions, 5806 flow [2022-12-06 05:42:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:07,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:07,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:07,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:07,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:07,514 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2139837605, now seen corresponding path program 1 times [2022-12-06 05:42:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:07,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719639761] [2022-12-06 05:42:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:07,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719639761] [2022-12-06 05:42:07,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719639761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:07,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:07,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:42:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990335550] [2022-12-06 05:42:07,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:07,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:42:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:07,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:42:07,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:42:07,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:42:07,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 271 transitions, 5806 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:07,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:07,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:42:07,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:07,997 INFO L130 PetriNetUnfolder]: 1066/1997 cut-off events. [2022-12-06 05:42:07,997 INFO L131 PetriNetUnfolder]: For 55343/55442 co-relation queries the response was YES. [2022-12-06 05:42:08,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18206 conditions, 1997 events. 1066/1997 cut-off events. For 55343/55442 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12282 event pairs, 77 based on Foata normal form. 76/2073 useless extension candidates. Maximal degree in co-relation 17557. Up to 1045 conditions per place. [2022-12-06 05:42:08,011 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 189 selfloop transitions, 161 changer transitions 6/357 dead transitions. [2022-12-06 05:42:08,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 357 transitions, 8208 flow [2022-12-06 05:42:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:42:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:42:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 05:42:08,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2022-12-06 05:42:08,012 INFO L175 Difference]: Start difference. First operand has 166 places, 271 transitions, 5806 flow. Second operand 5 states and 70 transitions. [2022-12-06 05:42:08,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 357 transitions, 8208 flow [2022-12-06 05:42:08,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 357 transitions, 8050 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:08,169 INFO L231 Difference]: Finished difference. Result has 171 places, 321 transitions, 7544 flow [2022-12-06 05:42:08,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5690, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7544, PETRI_PLACES=171, PETRI_TRANSITIONS=321} [2022-12-06 05:42:08,169 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 150 predicate places. [2022-12-06 05:42:08,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:08,169 INFO L89 Accepts]: Start accepts. Operand has 171 places, 321 transitions, 7544 flow [2022-12-06 05:42:08,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:08,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:08,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 321 transitions, 7544 flow [2022-12-06 05:42:08,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 321 transitions, 7544 flow [2022-12-06 05:42:08,275 INFO L130 PetriNetUnfolder]: 280/860 cut-off events. [2022-12-06 05:42:08,275 INFO L131 PetriNetUnfolder]: For 27761/28170 co-relation queries the response was YES. [2022-12-06 05:42:08,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7331 conditions, 860 events. 280/860 cut-off events. For 27761/28170 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6403 event pairs, 8 based on Foata normal form. 138/995 useless extension candidates. Maximal degree in co-relation 7160. Up to 259 conditions per place. [2022-12-06 05:42:08,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 321 transitions, 7544 flow [2022-12-06 05:42:08,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 05:42:08,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_648| v_~q~0.base_438)) (.cse1 (* v_~q_back~0_873 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_438)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415| 0)) (not (= 0 (ite (and (<= 0 v_~q_back~0_873) (< v_~q_back~0_873 v_~n~0_434)) 1 0))) (< 2 v_~N~0_330) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_445| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|) (= (+ 3 v_~q_back~0_873) v_~q_back~0_871) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_873))) (and (<= 0 .cse2) (< .cse2 v_~n~0_434))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_873, #memory_int=|v_#memory_int_648|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_291|, ~q_back~0=v_~q_back~0_871, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_287|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_445|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|, #memory_int=|v_#memory_int_648|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_287|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:08,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:08,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 280 [2022-12-06 05:42:08,449 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 321 transitions, 7562 flow [2022-12-06 05:42:08,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:08,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:08,449 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 05:42:08,449 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1389828171, now seen corresponding path program 2 times [2022-12-06 05:42:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:08,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742783957] [2022-12-06 05:42:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:09,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:09,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742783957] [2022-12-06 05:42:09,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742783957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:09,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568709534] [2022-12-06 05:42:09,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:42:09,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:09,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:09,191 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:09,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 05:42:09,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:42:09,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:42:09,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 05:42:09,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:09,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:09,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:42:09,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:09,513 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 59 treesize of output 16 [2022-12-06 05:42:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:09,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:09,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:09,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 197 treesize of output 180 [2022-12-06 05:42:09,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:09,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 99 [2022-12-06 05:42:09,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:09,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 99 treesize of output 79 [2022-12-06 05:42:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:09,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568709534] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:09,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:09,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:42:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368085437] [2022-12-06 05:42:09,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:09,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:42:09,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:09,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:42:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:42:09,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:42:09,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 321 transitions, 7562 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:09,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:09,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:42:09,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:12,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:42:12,781 INFO L130 PetriNetUnfolder]: 1061/1990 cut-off events. [2022-12-06 05:42:12,781 INFO L131 PetriNetUnfolder]: For 64411/64503 co-relation queries the response was YES. [2022-12-06 05:42:12,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19591 conditions, 1990 events. 1061/1990 cut-off events. For 64411/64503 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12290 event pairs, 229 based on Foata normal form. 77/2067 useless extension candidates. Maximal degree in co-relation 19182. Up to 1844 conditions per place. [2022-12-06 05:42:12,796 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 306 selfloop transitions, 38 changer transitions 2/347 dead transitions. [2022-12-06 05:42:12,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 347 transitions, 8490 flow [2022-12-06 05:42:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:42:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:42:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 05:42:12,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24624624624624625 [2022-12-06 05:42:12,797 INFO L175 Difference]: Start difference. First operand has 170 places, 321 transitions, 7562 flow. Second operand 9 states and 82 transitions. [2022-12-06 05:42:12,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 347 transitions, 8490 flow [2022-12-06 05:42:12,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 347 transitions, 8340 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-06 05:42:12,964 INFO L231 Difference]: Finished difference. Result has 178 places, 325 transitions, 7612 flow [2022-12-06 05:42:12,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7416, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7612, PETRI_PLACES=178, PETRI_TRANSITIONS=325} [2022-12-06 05:42:12,965 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2022-12-06 05:42:12,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:12,965 INFO L89 Accepts]: Start accepts. Operand has 178 places, 325 transitions, 7612 flow [2022-12-06 05:42:12,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:12,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:12,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 325 transitions, 7612 flow [2022-12-06 05:42:12,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 325 transitions, 7612 flow [2022-12-06 05:42:13,075 INFO L130 PetriNetUnfolder]: 281/864 cut-off events. [2022-12-06 05:42:13,076 INFO L131 PetriNetUnfolder]: For 27779/28181 co-relation queries the response was YES. [2022-12-06 05:42:13,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 864 events. 281/864 cut-off events. For 27779/28181 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6516 event pairs, 8 based on Foata normal form. 137/998 useless extension candidates. Maximal degree in co-relation 7010. Up to 263 conditions per place. [2022-12-06 05:42:13,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 325 transitions, 7612 flow [2022-12-06 05:42:13,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-06 05:42:13,084 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,084 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,085 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,085 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,085 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,085 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_721| v_~q~0.base_485)) (.cse1 (* v_~q_back~0_957 4))) (and (= (select .cse0 (+ (* 4 v_~q_front~0_820) v_~q~0.offset_485)) |v_thread2Thread1of1ForFork1_~j~0#1_485|) (= (+ v_~s~0_742 |v_thread2Thread1of1ForFork1_~j~0#1_485|) v_~s~0_741) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_485)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459| 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_957))) (and (<= 0 .cse2) (< .cse2 v_~n~0_476))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485 4)) 1) 1 0))) (= (+ 1 v_~q_front~0_820) v_~q_front~0_819) (= (+ 3 v_~q_back~0_957) v_~q_back~0_956) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|) (not (= (ite (and (<= 0 v_~q_back~0_957) (< v_~q_back~0_957 v_~n~0_476)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< 2 v_~N~0_358) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_485| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| (ite (and (<= 0 v_~q_front~0_820) (< v_~q_front~0_820 v_~q_back~0_956) (< v_~q_front~0_820 v_~n~0_476)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_957, #memory_int=|v_#memory_int_721|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, ~n~0=v_~n~0_476, ~q~0.offset=v_~q~0.offset_485, ~s~0=v_~s~0_742, ~q_front~0=v_~q_front~0_820} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_485|, ~q_back~0=v_~q_back~0_956, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_443|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_313|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_443|, ~q~0.offset=v_~q~0.offset_485, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_317|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_313|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_721|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|, ~n~0=v_~n~0_476, ~s~0=v_~s~0_741, ~q_front~0=v_~q_front~0_819} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:13,323 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,323 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,323 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,323 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,323 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,323 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:13,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:13,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 730 [2022-12-06 05:42:13,695 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 325 transitions, 7662 flow [2022-12-06 05:42:13,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:13,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:13,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:13,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-06 05:42:13,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:13,896 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1562240909, now seen corresponding path program 1 times [2022-12-06 05:42:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:13,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013967966] [2022-12-06 05:42:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013967966] [2022-12-06 05:42:14,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013967966] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599387721] [2022-12-06 05:42:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:14,635 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:14,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 05:42:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:14,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:42:14,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:14,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:14,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:42:14,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:14,915 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 12 [2022-12-06 05:42:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:14,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:15,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:15,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 174 [2022-12-06 05:42:15,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:15,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 97 [2022-12-06 05:42:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:15,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599387721] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:15,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:15,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:42:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213132451] [2022-12-06 05:42:15,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:42:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:42:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:42:15,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:42:15,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 325 transitions, 7662 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:15,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:15,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:42:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:16,225 INFO L130 PetriNetUnfolder]: 1093/2059 cut-off events. [2022-12-06 05:42:16,225 INFO L131 PetriNetUnfolder]: For 65528/65639 co-relation queries the response was YES. [2022-12-06 05:42:16,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20207 conditions, 2059 events. 1093/2059 cut-off events. For 65528/65639 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12910 event pairs, 224 based on Foata normal form. 73/2132 useless extension candidates. Maximal degree in co-relation 19330. Up to 1913 conditions per place. [2022-12-06 05:42:16,241 INFO L137 encePairwiseOnDemand]: 12/39 looper letters, 301 selfloop transitions, 50 changer transitions 13/365 dead transitions. [2022-12-06 05:42:16,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 365 transitions, 8900 flow [2022-12-06 05:42:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:42:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:42:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 05:42:16,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21153846153846154 [2022-12-06 05:42:16,242 INFO L175 Difference]: Start difference. First operand has 178 places, 325 transitions, 7662 flow. Second operand 12 states and 99 transitions. [2022-12-06 05:42:16,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 365 transitions, 8900 flow [2022-12-06 05:42:16,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 365 transitions, 8764 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-06 05:42:16,417 INFO L231 Difference]: Finished difference. Result has 191 places, 335 transitions, 7956 flow [2022-12-06 05:42:16,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7526, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7956, PETRI_PLACES=191, PETRI_TRANSITIONS=335} [2022-12-06 05:42:16,417 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-06 05:42:16,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:16,418 INFO L89 Accepts]: Start accepts. Operand has 191 places, 335 transitions, 7956 flow [2022-12-06 05:42:16,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:16,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:16,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 335 transitions, 7956 flow [2022-12-06 05:42:16,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 335 transitions, 7956 flow [2022-12-06 05:42:16,579 INFO L130 PetriNetUnfolder]: 286/884 cut-off events. [2022-12-06 05:42:16,579 INFO L131 PetriNetUnfolder]: For 30157/30596 co-relation queries the response was YES. [2022-12-06 05:42:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7633 conditions, 884 events. 286/884 cut-off events. For 30157/30596 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6722 event pairs, 8 based on Foata normal form. 139/1020 useless extension candidates. Maximal degree in co-relation 7485. Up to 270 conditions per place. [2022-12-06 05:42:16,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 335 transitions, 7956 flow [2022-12-06 05:42:16,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-06 05:42:16,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_725| v_~q~0.base_487)) (.cse5 (* 4 v_~q_front~0_829))) (let ((.cse3 (select .cse0 (+ v_~q~0.offset_487 .cse5))) (.cse1 (* v_~q_back~0_964 4))) (and (< 2 v_~N~0_360) (= |v_thread1Thread1of1ForFork0_~i~0#1_487| 3) (not (= (ite (and (< v_~q_front~0_829 v_~q_back~0_963) (< v_~q_front~0_829 v_~n~0_478) (<= 0 v_~q_front~0_829)) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_487)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|) (= (ite (let ((.cse2 (+ 1 v_~q_front~0_829))) (and (< .cse2 v_~q_back~0_963) (< .cse2 v_~n~0_478) (<= 0 .cse2))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487)) 1) 1 0) 0)) (not (= .cse3 0)) (not (= (ite (let ((.cse4 (+ 2 v_~q_back~0_964))) (and (< .cse4 v_~n~0_478) (<= 0 .cse4))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464| 0)) (= (+ .cse3 v_~s~0_753 |v_thread2Thread1of1ForFork1_~j~0#1_492|) v_~s~0_751) (= (select .cse0 (+ v_~q~0.offset_487 .cse5 4)) |v_thread2Thread1of1ForFork1_~j~0#1_492|) (= v_~q_back~0_963 (+ 3 v_~q_back~0_964)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_492| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|) (= (+ 2 v_~q_front~0_829) v_~q_front~0_827) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_964 v_~n~0_478) (<= 0 v_~q_back~0_964)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_964, #memory_int=|v_#memory_int_725|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, ~n~0=v_~n~0_478, ~q~0.offset=v_~q~0.offset_487, ~s~0=v_~s~0_753, ~q_front~0=v_~q_front~0_829} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_492|, ~q_back~0=v_~q_back~0_963, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_449|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_317|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_449|, ~q~0.offset=v_~q~0.offset_487, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_321|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_487|, #memory_int=|v_#memory_int_725|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|, ~n~0=v_~n~0_478, ~s~0=v_~s~0_751, ~q_front~0=v_~q_front~0_827} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:17,122 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:17,122 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:17,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_725| v_~q~0.base_487)) (.cse5 (* 4 v_~q_front~0_829))) (let ((.cse3 (select .cse0 (+ v_~q~0.offset_487 .cse5))) (.cse1 (* v_~q_back~0_964 4))) (and (< 2 v_~N~0_360) (= |v_thread1Thread1of1ForFork0_~i~0#1_487| 3) (not (= (ite (and (< v_~q_front~0_829 v_~q_back~0_963) (< v_~q_front~0_829 v_~n~0_478) (<= 0 v_~q_front~0_829)) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_487)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|) (= (ite (let ((.cse2 (+ 1 v_~q_front~0_829))) (and (< .cse2 v_~q_back~0_963) (< .cse2 v_~n~0_478) (<= 0 .cse2))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487)) 1) 1 0) 0)) (not (= .cse3 0)) (not (= (ite (let ((.cse4 (+ 2 v_~q_back~0_964))) (and (< .cse4 v_~n~0_478) (<= 0 .cse4))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464| 0)) (= (+ .cse3 v_~s~0_753 |v_thread2Thread1of1ForFork1_~j~0#1_492|) v_~s~0_751) (= (select .cse0 (+ v_~q~0.offset_487 .cse5 4)) |v_thread2Thread1of1ForFork1_~j~0#1_492|) (= v_~q_back~0_963 (+ 3 v_~q_back~0_964)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_492| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|) (= (+ 2 v_~q_front~0_829) v_~q_front~0_827) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_487 4)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_964 v_~n~0_478) (<= 0 v_~q_back~0_964)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_964, #memory_int=|v_#memory_int_725|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, ~n~0=v_~n~0_478, ~q~0.offset=v_~q~0.offset_487, ~s~0=v_~s~0_753, ~q_front~0=v_~q_front~0_829} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_492|, ~q_back~0=v_~q_back~0_963, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_449|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_317|, ~N~0=v_~N~0_360, ~q~0.base=v_~q~0.base_487, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_449|, ~q~0.offset=v_~q~0.offset_487, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_449|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_464|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_321|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_487|, #memory_int=|v_#memory_int_725|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|, ~n~0=v_~n~0_478, ~s~0=v_~s~0_751, ~q_front~0=v_~q_front~0_827} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:18,148 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:18,148 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:18,676 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:18,676 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:18,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_737| v_~q~0.base_497)) (.cse3 (* 4 v_~q_front~0_858))) (let ((.cse1 (select .cse2 (+ .cse3 v_~q~0.offset_497 4))) (.cse0 (select .cse2 (+ .cse3 v_~q~0.offset_497))) (.cse4 (* v_~q_back~0_994 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484| 0)) (= v_~s~0_781 (+ .cse0 .cse1 v_~s~0_783 |v_thread2Thread1of1ForFork1_~j~0#1_511|)) (= (select .cse2 (+ .cse3 8 v_~q~0.offset_497)) |v_thread2Thread1of1ForFork1_~j~0#1_511|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_497)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_113| 0) (= (+ 3 v_~q_front~0_858) v_~q_front~0_856) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| 3) (= (+ 3 v_~q_back~0_994) v_~q_back~0_993) (= |v_thread2Thread1of1ForFork1_~j~0#1_511| 0) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497)) 1) 1 0) 0)) (not (= .cse1 0)) (not (= 0 (ite (let ((.cse5 (+ 2 v_~q_back~0_994))) (and (< .cse5 v_~n~0_488) (<= 0 .cse5))) 1 0))) (< 2 v_~N~0_370) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_113| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (not (= 0 (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497 4)) 1) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (let ((.cse6 (+ 2 v_~q_front~0_858))) (and (< .cse6 v_~n~0_488) (< .cse6 v_~q_back~0_993) (<= 0 .cse6))) 1 0)) (not (= (ite (and (< v_~q_front~0_858 v_~n~0_488) (< v_~q_front~0_858 v_~q_back~0_993) (<= 0 v_~q_front~0_858)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_994, #memory_int=|v_#memory_int_737|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_488, ~q~0.offset=v_~q~0.offset_497, ~s~0=v_~s~0_783, ~q_front~0=v_~q_front~0_858} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_511|, ~q_back~0=v_~q_back~0_993, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_113|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_467|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_334|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_467|, ~q~0.offset=v_~q~0.offset_497, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_113|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_338|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_334|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_737|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|, ~n~0=v_~n~0_488, ~s~0=v_~s~0_781, ~q_front~0=v_~q_front~0_856} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_#res#1.offset, 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, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:19,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_737| v_~q~0.base_497)) (.cse3 (* 4 v_~q_front~0_858))) (let ((.cse1 (select .cse2 (+ .cse3 v_~q~0.offset_497 4))) (.cse0 (select .cse2 (+ .cse3 v_~q~0.offset_497))) (.cse4 (* v_~q_back~0_994 4))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484| 0)) (= v_~s~0_781 (+ .cse0 .cse1 v_~s~0_783 |v_thread2Thread1of1ForFork1_~j~0#1_511|)) (= (select .cse2 (+ .cse3 8 v_~q~0.offset_497)) |v_thread2Thread1of1ForFork1_~j~0#1_511|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_497)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_113| 0) (= (+ 3 v_~q_front~0_858) v_~q_front~0_856) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| 3) (= (+ 3 v_~q_back~0_994) v_~q_back~0_993) (= |v_thread2Thread1of1ForFork1_~j~0#1_511| 0) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497)) 1) 1 0) 0)) (not (= .cse1 0)) (not (= 0 (ite (let ((.cse5 (+ 2 v_~q_back~0_994))) (and (< .cse5 v_~n~0_488) (<= 0 .cse5))) 1 0))) (< 2 v_~N~0_370) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_113| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (not (= 0 (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_497 4)) 1) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (let ((.cse6 (+ 2 v_~q_front~0_858))) (and (< .cse6 v_~n~0_488) (< .cse6 v_~q_back~0_993) (<= 0 .cse6))) 1 0)) (not (= (ite (and (< v_~q_front~0_858 v_~n~0_488) (< v_~q_front~0_858 v_~q_back~0_993) (<= 0 v_~q_front~0_858)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_994, #memory_int=|v_#memory_int_737|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, ~n~0=v_~n~0_488, ~q~0.offset=v_~q~0.offset_497, ~s~0=v_~s~0_783, ~q_front~0=v_~q_front~0_858} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_511|, ~q_back~0=v_~q_back~0_993, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_113|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_467|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_334|, ~N~0=v_~N~0_370, ~q~0.base=v_~q~0.base_497, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_467|, ~q~0.offset=v_~q~0.offset_497, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_484|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_113|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_338|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_334|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_737|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_484|, ~n~0=v_~n~0_488, ~s~0=v_~s~0_781, ~q_front~0=v_~q_front~0_856} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, ~q_back~0, thread2Thread1of1ForFork1_#res#1.offset, 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, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:19,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (select |v_#memory_int_735| v_~q~0.base_495)) (.cse5 (* 4 v_~q_front~0_853))) (let ((.cse2 (* v_~q_back~0_989 4)) (.cse3 (+ 2 v_~q_front~0_853)) (.cse4 (+ 1 v_~q_front~0_853)) (.cse0 (select .cse1 (+ .cse5 v_~q~0.offset_495)))) (and (not (= (ite (and (< v_~q_back~0_987 (+ v_~n~0_486 1)) (<= 1 v_~q_back~0_987)) 1 0) 0)) (= (+ .cse0 v_~s~0_778 |v_thread2Thread1of1ForFork1_~j~0#1_509|) v_~s~0_777) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_480| (ite (= (select .cse1 (+ (- 4) (* v_~q_back~0_987 4) v_~q~0.offset_495)) 0) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_200| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_495)) 1) 1 0) 0)) (= .cse3 v_~q_front~0_852) (not (= (ite (and (< v_~q_front~0_853 v_~n~0_486) (<= 0 v_~q_front~0_853) (< .cse4 v_~q_back~0_987)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_989 v_~n~0_486) (<= 0 v_~q_back~0_989)) 1 0) 0)) (= (select .cse1 (+ .cse5 v_~q~0.offset_495 4)) |v_thread2Thread1of1ForFork1_~j~0#1_509|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_200| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_480| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_480|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_480| 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_495)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_509| 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_495 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| (ite (and (< .cse4 v_~n~0_486) (< .cse3 v_~q_back~0_987) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_503| 3) (= v_~q_back~0_987 (+ v_~q_back~0_989 4)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_503| v_~N~0_368)) (not (= .cse0 0)) (< 2 v_~N~0_368)))) InVars {~q_back~0=v_~q_back~0_989, #memory_int=|v_#memory_int_735|, ~N~0=v_~N~0_368, ~q~0.base=v_~q~0.base_495, ~n~0=v_~n~0_486, ~q~0.offset=v_~q~0.offset_495, ~s~0=v_~s~0_778, ~q_front~0=v_~q_front~0_853} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_509|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_200|, ~q_back~0=v_~q_back~0_987, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_218|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_465|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_332|, ~N~0=v_~N~0_368, ~q~0.base=v_~q~0.base_495, ~q~0.offset=v_~q~0.offset_495, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_465|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_480|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_336|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_332|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_503|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_218|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_480|, #memory_int=|v_#memory_int_735|, ~n~0=v_~n~0_486, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_200|, ~s~0=v_~s~0_777, ~q_front~0=v_~q_front~0_852} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [771] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_739| v_~q~0.base_499)) (.cse1 (* 4 v_~q_front~0_864))) (and (not (= (+ v_~s~0_789 |v_thread2Thread1of1ForFork1_~j~0#1_515|) v_~s~0_787)) (= (select .cse0 (+ .cse1 v_~q~0.offset_499 4)) |v_thread2Thread1of1ForFork1_~j~0#1_515|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471| 0)) (not (= (ite (and (<= 0 v_~q_front~0_864) (< v_~q_front~0_864 v_~q_back~0_997) (< v_~q_front~0_864 v_~n~0_490)) 1 0) 0)) (= (+ 2 v_~q_front~0_864) v_~q_front~0_862) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| (ite (let ((.cse2 (+ 1 v_~q_front~0_864))) (and (< .cse2 v_~n~0_490) (< .cse2 v_~q_back~0_997) (<= 0 .cse2))) 1 0)) (= (+ (select .cse0 (+ .cse1 v_~q~0.offset_499)) v_~s~0_789 |v_thread2Thread1of1ForFork1_~j~0#1_515|) v_~s~0_787) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_515| 0)))) InVars {~q_back~0=v_~q_back~0_997, #memory_int=|v_#memory_int_739|, ~q~0.base=v_~q~0.base_499, ~n~0=v_~n~0_490, ~q~0.offset=v_~q~0.offset_499, ~s~0=v_~s~0_789, ~q_front~0=v_~q_front~0_864} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_515|, ~q_back~0=v_~q_back~0_997, #memory_int=|v_#memory_int_739|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_471|, ~q~0.base=v_~q~0.base_499, ~n~0=v_~n~0_490, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_471|, ~q~0.offset=v_~q~0.offset_499, ~s~0=v_~s~0_787, ~q_front~0=v_~q_front~0_862} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:19,824 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:19,824 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:19,824 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:19,824 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:19,824 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:19,824 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:20,440 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:42:20,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4023 [2022-12-06 05:42:20,441 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 333 transitions, 8070 flow [2022-12-06 05:42:20,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:20,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:20,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:20,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:20,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-06 05:42:20,643 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1986601575, now seen corresponding path program 1 times [2022-12-06 05:42:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:20,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154119447] [2022-12-06 05:42:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:20,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154119447] [2022-12-06 05:42:20,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154119447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:20,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:20,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:42:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825987678] [2022-12-06 05:42:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:20,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:42:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:20,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:42:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:42:20,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:42:20,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 333 transitions, 8070 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) 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 05:42:20,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:20,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:42:20,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:21,370 INFO L130 PetriNetUnfolder]: 1078/2016 cut-off events. [2022-12-06 05:42:21,370 INFO L131 PetriNetUnfolder]: For 70644/70747 co-relation queries the response was YES. [2022-12-06 05:42:21,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19935 conditions, 2016 events. 1078/2016 cut-off events. For 70644/70747 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12379 event pairs, 258 based on Foata normal form. 71/2087 useless extension candidates. Maximal degree in co-relation 19744. Up to 1950 conditions per place. [2022-12-06 05:42:21,389 INFO L137 encePairwiseOnDemand]: 22/45 looper letters, 312 selfloop transitions, 23 changer transitions 2/338 dead transitions. [2022-12-06 05:42:21,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 338 transitions, 8677 flow [2022-12-06 05:42:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:42:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:42:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 05:42:21,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2022-12-06 05:42:21,390 INFO L175 Difference]: Start difference. First operand has 188 places, 333 transitions, 8070 flow. Second operand 3 states and 59 transitions. [2022-12-06 05:42:21,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 338 transitions, 8677 flow [2022-12-06 05:42:21,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 338 transitions, 8551 flow, removed 44 selfloop flow, removed 7 redundant places. [2022-12-06 05:42:21,633 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 7792 flow [2022-12-06 05:42:21,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7727, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7792, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2022-12-06 05:42:21,634 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 162 predicate places. [2022-12-06 05:42:21,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:21,634 INFO L89 Accepts]: Start accepts. Operand has 183 places, 330 transitions, 7792 flow [2022-12-06 05:42:21,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:21,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:21,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 330 transitions, 7792 flow [2022-12-06 05:42:21,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 330 transitions, 7792 flow [2022-12-06 05:42:21,791 INFO L130 PetriNetUnfolder]: 287/872 cut-off events. [2022-12-06 05:42:21,791 INFO L131 PetriNetUnfolder]: For 29457/29883 co-relation queries the response was YES. [2022-12-06 05:42:21,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7540 conditions, 872 events. 287/872 cut-off events. For 29457/29883 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6507 event pairs, 7 based on Foata normal form. 138/1007 useless extension candidates. Maximal degree in co-relation 7239. Up to 268 conditions per place. [2022-12-06 05:42:21,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 330 transitions, 7792 flow [2022-12-06 05:42:21,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-06 05:42:21,804 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:21,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:42:21,805 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 330 transitions, 7792 flow [2022-12-06 05:42:21,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) 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 05:42:21,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:21,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 05:42:21,805 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1646597253, now seen corresponding path program 1 times [2022-12-06 05:42:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580404253] [2022-12-06 05:42:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:22,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:22,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580404253] [2022-12-06 05:42:22,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580404253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:22,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:22,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:42:22,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111699462] [2022-12-06 05:42:22,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:22,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:42:22,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:42:22,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:42:22,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:42:22,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 330 transitions, 7792 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:42:22,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:22,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:42:22,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:22,647 INFO L130 PetriNetUnfolder]: 1106/2073 cut-off events. [2022-12-06 05:42:22,647 INFO L131 PetriNetUnfolder]: For 68078/68166 co-relation queries the response was YES. [2022-12-06 05:42:22,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20370 conditions, 2073 events. 1106/2073 cut-off events. For 68078/68166 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12835 event pairs, 285 based on Foata normal form. 53/2126 useless extension candidates. Maximal degree in co-relation 19589. Up to 1969 conditions per place. [2022-12-06 05:42:22,667 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 328 selfloop transitions, 26 changer transitions 0/355 dead transitions. [2022-12-06 05:42:22,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 355 transitions, 8877 flow [2022-12-06 05:42:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:42:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:42:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 05:42:22,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 05:42:22,668 INFO L175 Difference]: Start difference. First operand has 181 places, 330 transitions, 7792 flow. Second operand 6 states and 68 transitions. [2022-12-06 05:42:22,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 355 transitions, 8877 flow [2022-12-06 05:42:22,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 8803 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:42:22,896 INFO L231 Difference]: Finished difference. Result has 186 places, 340 transitions, 8070 flow [2022-12-06 05:42:22,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7720, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8070, PETRI_PLACES=186, PETRI_TRANSITIONS=340} [2022-12-06 05:42:22,896 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 165 predicate places. [2022-12-06 05:42:22,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:22,896 INFO L89 Accepts]: Start accepts. Operand has 186 places, 340 transitions, 8070 flow [2022-12-06 05:42:22,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:22,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:22,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 340 transitions, 8070 flow [2022-12-06 05:42:22,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 340 transitions, 8070 flow [2022-12-06 05:42:23,039 INFO L130 PetriNetUnfolder]: 295/903 cut-off events. [2022-12-06 05:42:23,040 INFO L131 PetriNetUnfolder]: For 30453/30865 co-relation queries the response was YES. [2022-12-06 05:42:23,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7795 conditions, 903 events. 295/903 cut-off events. For 30453/30865 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6846 event pairs, 8 based on Foata normal form. 137/1037 useless extension candidates. Maximal degree in co-relation 7493. Up to 284 conditions per place. [2022-12-06 05:42:23,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 340 transitions, 8070 flow [2022-12-06 05:42:23,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-06 05:42:23,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:23,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:23,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:23,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 05:42:23,418 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 340 transitions, 8140 flow [2022-12-06 05:42:23,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:42:23,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:23,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:23,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 05:42:23,418 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1517066089, now seen corresponding path program 1 times [2022-12-06 05:42:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:23,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073694785] [2022-12-06 05:42:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:23,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073694785] [2022-12-06 05:42:23,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073694785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:23,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:23,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279237933] [2022-12-06 05:42:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:23,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:23,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:23,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:23,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:42:23,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 340 transitions, 8140 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:23,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:23,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:42:23,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:24,222 INFO L130 PetriNetUnfolder]: 1098/2049 cut-off events. [2022-12-06 05:42:24,222 INFO L131 PetriNetUnfolder]: For 68404/68492 co-relation queries the response was YES. [2022-12-06 05:42:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20277 conditions, 2049 events. 1098/2049 cut-off events. For 68404/68492 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12561 event pairs, 285 based on Foata normal form. 51/2100 useless extension candidates. Maximal degree in co-relation 19830. Up to 1969 conditions per place. [2022-12-06 05:42:24,241 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 324 selfloop transitions, 21 changer transitions 1/347 dead transitions. [2022-12-06 05:42:24,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 347 transitions, 8776 flow [2022-12-06 05:42:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 05:42:24,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-06 05:42:24,243 INFO L175 Difference]: Start difference. First operand has 186 places, 340 transitions, 8140 flow. Second operand 4 states and 58 transitions. [2022-12-06 05:42:24,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 347 transitions, 8776 flow [2022-12-06 05:42:24,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 347 transitions, 8622 flow, removed 60 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:24,467 INFO L231 Difference]: Finished difference. Result has 187 places, 337 transitions, 7887 flow [2022-12-06 05:42:24,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7861, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7887, PETRI_PLACES=187, PETRI_TRANSITIONS=337} [2022-12-06 05:42:24,467 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-06 05:42:24,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:24,467 INFO L89 Accepts]: Start accepts. Operand has 187 places, 337 transitions, 7887 flow [2022-12-06 05:42:24,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:24,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:24,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 337 transitions, 7887 flow [2022-12-06 05:42:24,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 337 transitions, 7887 flow [2022-12-06 05:42:24,586 INFO L130 PetriNetUnfolder]: 293/887 cut-off events. [2022-12-06 05:42:24,586 INFO L131 PetriNetUnfolder]: For 30863/31345 co-relation queries the response was YES. [2022-12-06 05:42:24,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7636 conditions, 887 events. 293/887 cut-off events. For 30863/31345 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6633 event pairs, 8 based on Foata normal form. 143/1027 useless extension candidates. Maximal degree in co-relation 7427. Up to 271 conditions per place. [2022-12-06 05:42:24,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 337 transitions, 7887 flow [2022-12-06 05:42:24,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 05:42:24,596 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:24,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 05:42:24,596 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 337 transitions, 7887 flow [2022-12-06 05:42:24,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:24,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:24,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:24,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 05:42:24,597 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -742243841, now seen corresponding path program 1 times [2022-12-06 05:42:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828788044] [2022-12-06 05:42:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:24,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828788044] [2022-12-06 05:42:24,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828788044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:24,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:24,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739711519] [2022-12-06 05:42:24,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:24,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:24,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:42:24,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 337 transitions, 7887 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:24,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:24,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:42:24,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:25,080 INFO L130 PetriNetUnfolder]: 1090/2037 cut-off events. [2022-12-06 05:42:25,080 INFO L131 PetriNetUnfolder]: For 67234/67314 co-relation queries the response was YES. [2022-12-06 05:42:25,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19961 conditions, 2037 events. 1090/2037 cut-off events. For 67234/67314 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12474 event pairs, 243 based on Foata normal form. 64/2101 useless extension candidates. Maximal degree in co-relation 19361. Up to 1973 conditions per place. [2022-12-06 05:42:25,096 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 312 selfloop transitions, 26 changer transitions 0/339 dead transitions. [2022-12-06 05:42:25,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 339 transitions, 8568 flow [2022-12-06 05:42:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:42:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:42:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 05:42:25,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-06 05:42:25,097 INFO L175 Difference]: Start difference. First operand has 186 places, 337 transitions, 7887 flow. Second operand 3 states and 49 transitions. [2022-12-06 05:42:25,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 339 transitions, 8568 flow [2022-12-06 05:42:25,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 339 transitions, 8518 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:42:25,346 INFO L231 Difference]: Finished difference. Result has 185 places, 337 transitions, 7919 flow [2022-12-06 05:42:25,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7837, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7919, PETRI_PLACES=185, PETRI_TRANSITIONS=337} [2022-12-06 05:42:25,346 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-06 05:42:25,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:25,346 INFO L89 Accepts]: Start accepts. Operand has 185 places, 337 transitions, 7919 flow [2022-12-06 05:42:25,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:25,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:25,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 337 transitions, 7919 flow [2022-12-06 05:42:25,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 337 transitions, 7919 flow [2022-12-06 05:42:25,458 INFO L130 PetriNetUnfolder]: 290/883 cut-off events. [2022-12-06 05:42:25,458 INFO L131 PetriNetUnfolder]: For 30795/31228 co-relation queries the response was YES. [2022-12-06 05:42:25,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 883 events. 290/883 cut-off events. For 30795/31228 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6639 event pairs, 7 based on Foata normal form. 138/1018 useless extension candidates. Maximal degree in co-relation 7333. Up to 267 conditions per place. [2022-12-06 05:42:25,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 337 transitions, 7919 flow [2022-12-06 05:42:25,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 05:42:25,467 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:25,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 05:42:25,468 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 337 transitions, 7919 flow [2022-12-06 05:42:25,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:25,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:25,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:25,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 05:42:25,468 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 826158059, now seen corresponding path program 2 times [2022-12-06 05:42:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:25,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455115655] [2022-12-06 05:42:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:26,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455115655] [2022-12-06 05:42:26,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455115655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:26,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:26,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:42:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960468652] [2022-12-06 05:42:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:26,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:42:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:42:26,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:42:26,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:42:26,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 337 transitions, 7919 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:26,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:26,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:42:26,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:27,456 INFO L130 PetriNetUnfolder]: 1096/2053 cut-off events. [2022-12-06 05:42:27,457 INFO L131 PetriNetUnfolder]: For 68763/68845 co-relation queries the response was YES. [2022-12-06 05:42:27,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20208 conditions, 2053 events. 1096/2053 cut-off events. For 68763/68845 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12774 event pairs, 270 based on Foata normal form. 46/2099 useless extension candidates. Maximal degree in co-relation 19785. Up to 1951 conditions per place. [2022-12-06 05:42:27,470 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 322 selfloop transitions, 26 changer transitions 5/354 dead transitions. [2022-12-06 05:42:27,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 354 transitions, 8813 flow [2022-12-06 05:42:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:42:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:42:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 05:42:27,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-06 05:42:27,471 INFO L175 Difference]: Start difference. First operand has 185 places, 337 transitions, 7919 flow. Second operand 6 states and 66 transitions. [2022-12-06 05:42:27,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 354 transitions, 8813 flow [2022-12-06 05:42:27,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 354 transitions, 8761 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:27,650 INFO L231 Difference]: Finished difference. Result has 191 places, 339 transitions, 8008 flow [2022-12-06 05:42:27,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7867, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8008, PETRI_PLACES=191, PETRI_TRANSITIONS=339} [2022-12-06 05:42:27,651 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-06 05:42:27,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:27,651 INFO L89 Accepts]: Start accepts. Operand has 191 places, 339 transitions, 8008 flow [2022-12-06 05:42:27,652 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:27,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:27,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 339 transitions, 8008 flow [2022-12-06 05:42:27,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 339 transitions, 8008 flow [2022-12-06 05:42:27,768 INFO L130 PetriNetUnfolder]: 290/886 cut-off events. [2022-12-06 05:42:27,769 INFO L131 PetriNetUnfolder]: For 31014/31448 co-relation queries the response was YES. [2022-12-06 05:42:27,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 886 events. 290/886 cut-off events. For 31014/31448 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6702 event pairs, 7 based on Foata normal form. 138/1021 useless extension candidates. Maximal degree in co-relation 7515. Up to 267 conditions per place. [2022-12-06 05:42:27,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 339 transitions, 8008 flow [2022-12-06 05:42:27,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-06 05:42:27,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:27,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 05:42:27,779 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 339 transitions, 8008 flow [2022-12-06 05:42:27,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:27,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:27,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:27,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 05:42:27,779 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 415137550, now seen corresponding path program 1 times [2022-12-06 05:42:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:27,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627747757] [2022-12-06 05:42:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:28,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:28,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627747757] [2022-12-06 05:42:28,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627747757] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:28,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891953254] [2022-12-06 05:42:28,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:28,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:28,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:28,181 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:28,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 05:42:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:28,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:42:28,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:28,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:28,422 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:42:28,423 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 25 treesize of output 16 [2022-12-06 05:42:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:28,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891953254] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:28,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:28,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 9 [2022-12-06 05:42:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820572784] [2022-12-06 05:42:28,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:28,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:42:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:42:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:42:28,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:42:28,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 339 transitions, 8008 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 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 05:42:28,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:28,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:42:28,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:29,098 INFO L130 PetriNetUnfolder]: 1106/2062 cut-off events. [2022-12-06 05:42:29,099 INFO L131 PetriNetUnfolder]: For 68701/68783 co-relation queries the response was YES. [2022-12-06 05:42:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20430 conditions, 2062 events. 1106/2062 cut-off events. For 68701/68783 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12741 event pairs, 221 based on Foata normal form. 69/2131 useless extension candidates. Maximal degree in co-relation 20256. Up to 1677 conditions per place. [2022-12-06 05:42:29,113 INFO L137 encePairwiseOnDemand]: 13/40 looper letters, 280 selfloop transitions, 95 changer transitions 0/376 dead transitions. [2022-12-06 05:42:29,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 376 transitions, 9243 flow [2022-12-06 05:42:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:42:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:42:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 05:42:29,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29285714285714287 [2022-12-06 05:42:29,116 INFO L175 Difference]: Start difference. First operand has 190 places, 339 transitions, 8008 flow. Second operand 7 states and 82 transitions. [2022-12-06 05:42:29,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 376 transitions, 9243 flow [2022-12-06 05:42:29,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 376 transitions, 9160 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 05:42:29,324 INFO L231 Difference]: Finished difference. Result has 194 places, 344 transitions, 8329 flow [2022-12-06 05:42:29,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7925, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8329, PETRI_PLACES=194, PETRI_TRANSITIONS=344} [2022-12-06 05:42:29,325 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-06 05:42:29,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:29,325 INFO L89 Accepts]: Start accepts. Operand has 194 places, 344 transitions, 8329 flow [2022-12-06 05:42:29,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:29,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:29,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 344 transitions, 8329 flow [2022-12-06 05:42:29,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 344 transitions, 8329 flow [2022-12-06 05:42:29,447 INFO L130 PetriNetUnfolder]: 294/897 cut-off events. [2022-12-06 05:42:29,447 INFO L131 PetriNetUnfolder]: For 32324/32697 co-relation queries the response was YES. [2022-12-06 05:42:29,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 897 events. 294/897 cut-off events. For 32324/32697 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6803 event pairs, 9 based on Foata normal form. 132/1026 useless extension candidates. Maximal degree in co-relation 7673. Up to 270 conditions per place. [2022-12-06 05:42:29,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 344 transitions, 8329 flow [2022-12-06 05:42:29,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-06 05:42:29,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:29,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 05:42:29,458 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 344 transitions, 8329 flow [2022-12-06 05:42:29,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 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 05:42:29,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:29,458 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:29,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:29,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2022-12-06 05:42:29,665 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash -456378956, now seen corresponding path program 1 times [2022-12-06 05:42:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:29,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397491104] [2022-12-06 05:42:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:29,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:30,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397491104] [2022-12-06 05:42:30,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397491104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:30,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139960389] [2022-12-06 05:42:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:30,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:30,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:30,628 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:30,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-06 05:42:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:30,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:42:30,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:30,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:30,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:42:30,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:30,937 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 46 treesize of output 12 [2022-12-06 05:42:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:30,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:31,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:31,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 178 [2022-12-06 05:42:31,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:31,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 101 [2022-12-06 05:42:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:31,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139960389] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:31,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:31,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 05:42:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259691132] [2022-12-06 05:42:31,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:31,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:42:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:42:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:42:31,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:42:31,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 344 transitions, 8329 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:31,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:31,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:42:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:32,428 INFO L130 PetriNetUnfolder]: 1149/2144 cut-off events. [2022-12-06 05:42:32,429 INFO L131 PetriNetUnfolder]: For 77380/77454 co-relation queries the response was YES. [2022-12-06 05:42:32,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21830 conditions, 2144 events. 1149/2144 cut-off events. For 77380/77454 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13343 event pairs, 147 based on Foata normal form. 60/2204 useless extension candidates. Maximal degree in co-relation 21192. Up to 1900 conditions per place. [2022-12-06 05:42:32,445 INFO L137 encePairwiseOnDemand]: 12/40 looper letters, 311 selfloop transitions, 67 changer transitions 24/403 dead transitions. [2022-12-06 05:42:32,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 403 transitions, 9806 flow [2022-12-06 05:42:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:42:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:42:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2022-12-06 05:42:32,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2109375 [2022-12-06 05:42:32,446 INFO L175 Difference]: Start difference. First operand has 194 places, 344 transitions, 8329 flow. Second operand 16 states and 135 transitions. [2022-12-06 05:42:32,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 403 transitions, 9806 flow [2022-12-06 05:42:32,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 403 transitions, 9663 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 05:42:32,662 INFO L231 Difference]: Finished difference. Result has 212 places, 351 transitions, 8632 flow [2022-12-06 05:42:32,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8180, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8632, PETRI_PLACES=212, PETRI_TRANSITIONS=351} [2022-12-06 05:42:32,663 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2022-12-06 05:42:32,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:32,663 INFO L89 Accepts]: Start accepts. Operand has 212 places, 351 transitions, 8632 flow [2022-12-06 05:42:32,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:32,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:32,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 351 transitions, 8632 flow [2022-12-06 05:42:32,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 351 transitions, 8632 flow [2022-12-06 05:42:32,787 INFO L130 PetriNetUnfolder]: 301/903 cut-off events. [2022-12-06 05:42:32,787 INFO L131 PetriNetUnfolder]: For 35410/35771 co-relation queries the response was YES. [2022-12-06 05:42:32,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8234 conditions, 903 events. 301/903 cut-off events. For 35410/35771 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6793 event pairs, 8 based on Foata normal form. 127/1027 useless extension candidates. Maximal degree in co-relation 7973. Up to 285 conditions per place. [2022-12-06 05:42:32,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 351 transitions, 8632 flow [2022-12-06 05:42:32,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-06 05:42:32,807 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:32,807 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:32,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:33,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:33,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:33,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:33,331 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:33,331 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:33,331 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:33,331 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:33,331 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:33,331 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:33,603 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:42:33,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-06 05:42:33,603 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 349 transitions, 8654 flow [2022-12-06 05:42:33,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:33,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:33,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:33,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:33,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-12-06 05:42:33,804 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash -592806890, now seen corresponding path program 1 times [2022-12-06 05:42:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:33,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502582229] [2022-12-06 05:42:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502582229] [2022-12-06 05:42:34,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502582229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811716053] [2022-12-06 05:42:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:34,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:34,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:34,174 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:34,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-06 05:42:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:34,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:42:34,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:34,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:34,432 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:42:34,432 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 27 treesize of output 16 [2022-12-06 05:42:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:34,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811716053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:34,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:34,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2022-12-06 05:42:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013980312] [2022-12-06 05:42:34,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:34,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:42:34,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:42:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:42:34,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:42:34,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 349 transitions, 8654 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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 05:42:34,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:34,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:42:34,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:35,245 INFO L130 PetriNetUnfolder]: 1147/2134 cut-off events. [2022-12-06 05:42:35,245 INFO L131 PetriNetUnfolder]: For 81151/81201 co-relation queries the response was YES. [2022-12-06 05:42:35,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21826 conditions, 2134 events. 1147/2134 cut-off events. For 81151/81201 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13123 event pairs, 217 based on Foata normal form. 72/2206 useless extension candidates. Maximal degree in co-relation 21547. Up to 1511 conditions per place. [2022-12-06 05:42:35,264 INFO L137 encePairwiseOnDemand]: 17/45 looper letters, 298 selfloop transitions, 124 changer transitions 1/424 dead transitions. [2022-12-06 05:42:35,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 424 transitions, 10603 flow [2022-12-06 05:42:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:42:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:42:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-06 05:42:35,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24888888888888888 [2022-12-06 05:42:35,265 INFO L175 Difference]: Start difference. First operand has 206 places, 349 transitions, 8654 flow. Second operand 10 states and 112 transitions. [2022-12-06 05:42:35,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 424 transitions, 10603 flow [2022-12-06 05:42:35,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 424 transitions, 10386 flow, removed 76 selfloop flow, removed 8 redundant places. [2022-12-06 05:42:35,523 INFO L231 Difference]: Finished difference. Result has 209 places, 356 transitions, 8971 flow [2022-12-06 05:42:35,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=8390, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8971, PETRI_PLACES=209, PETRI_TRANSITIONS=356} [2022-12-06 05:42:35,523 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-06 05:42:35,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:35,524 INFO L89 Accepts]: Start accepts. Operand has 209 places, 356 transitions, 8971 flow [2022-12-06 05:42:35,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:35,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:35,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 356 transitions, 8971 flow [2022-12-06 05:42:35,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 356 transitions, 8971 flow [2022-12-06 05:42:35,658 INFO L130 PetriNetUnfolder]: 306/922 cut-off events. [2022-12-06 05:42:35,658 INFO L131 PetriNetUnfolder]: For 35450/35802 co-relation queries the response was YES. [2022-12-06 05:42:35,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8428 conditions, 922 events. 306/922 cut-off events. For 35450/35802 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6960 event pairs, 7 based on Foata normal form. 120/1039 useless extension candidates. Maximal degree in co-relation 8187. Up to 295 conditions per place. [2022-12-06 05:42:35,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 356 transitions, 8971 flow [2022-12-06 05:42:35,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 05:42:35,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:42:36,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:36,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:36,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 710 [2022-12-06 05:42:36,233 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 356 transitions, 9009 flow [2022-12-06 05:42:36,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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 05:42:36,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:36,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:36,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:36,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:36,434 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1557526877, now seen corresponding path program 2 times [2022-12-06 05:42:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:36,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699438394] [2022-12-06 05:42:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:36,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:37,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699438394] [2022-12-06 05:42:37,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699438394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:37,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779174772] [2022-12-06 05:42:37,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:42:37,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:37,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:37,289 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:37,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-06 05:42:37,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:42:37,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:42:37,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:42:37,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:37,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:37,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:42:37,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:37,592 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 46 treesize of output 12 [2022-12-06 05:42:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:37,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:37,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:37,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 174 [2022-12-06 05:42:37,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:37,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 97 [2022-12-06 05:42:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:38,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779174772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:38,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:38,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:42:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261310875] [2022-12-06 05:42:38,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:38,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:42:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:42:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:42:38,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:42:38,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 356 transitions, 9009 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:38,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:38,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:42:38,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:38,942 INFO L130 PetriNetUnfolder]: 1151/2153 cut-off events. [2022-12-06 05:42:38,942 INFO L131 PetriNetUnfolder]: For 79796/79837 co-relation queries the response was YES. [2022-12-06 05:42:38,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22212 conditions, 2153 events. 1151/2153 cut-off events. For 79796/79837 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13596 event pairs, 343 based on Foata normal form. 6/2159 useless extension candidates. Maximal degree in co-relation 21612. Up to 2017 conditions per place. [2022-12-06 05:42:38,960 INFO L137 encePairwiseOnDemand]: 21/48 looper letters, 317 selfloop transitions, 51 changer transitions 6/375 dead transitions. [2022-12-06 05:42:38,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 375 transitions, 9885 flow [2022-12-06 05:42:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:42:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:42:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-12-06 05:42:38,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18333333333333332 [2022-12-06 05:42:38,961 INFO L175 Difference]: Start difference. First operand has 208 places, 356 transitions, 9009 flow. Second operand 10 states and 88 transitions. [2022-12-06 05:42:38,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 375 transitions, 9885 flow [2022-12-06 05:42:39,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 375 transitions, 9610 flow, removed 68 selfloop flow, removed 6 redundant places. [2022-12-06 05:42:39,206 INFO L231 Difference]: Finished difference. Result has 213 places, 357 transitions, 8878 flow [2022-12-06 05:42:39,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8734, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8878, PETRI_PLACES=213, PETRI_TRANSITIONS=357} [2022-12-06 05:42:39,206 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2022-12-06 05:42:39,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:39,206 INFO L89 Accepts]: Start accepts. Operand has 213 places, 357 transitions, 8878 flow [2022-12-06 05:42:39,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:39,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:39,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 357 transitions, 8878 flow [2022-12-06 05:42:39,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 357 transitions, 8878 flow [2022-12-06 05:42:39,334 INFO L130 PetriNetUnfolder]: 306/924 cut-off events. [2022-12-06 05:42:39,335 INFO L131 PetriNetUnfolder]: For 33651/34014 co-relation queries the response was YES. [2022-12-06 05:42:39,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8350 conditions, 924 events. 306/924 cut-off events. For 33651/34014 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7055 event pairs, 7 based on Foata normal form. 113/1033 useless extension candidates. Maximal degree in co-relation 8189. Up to 295 conditions per place. [2022-12-06 05:42:39,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 357 transitions, 8878 flow [2022-12-06 05:42:39,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 1154 [2022-12-06 05:42:39,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_733| v_~q~0.base_493)) (.cse5 (* 4 v_~q_front~0_848))) (let ((.cse1 (* v_~q_back~0_984 4)) (.cse3 (select .cse0 (+ .cse5 v_~q~0.offset_493))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_493 4)))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_984))) (and (<= 0 .cse2) (< .cse2 v_~n~0_484))) 1 0) 0)) (< 2 v_~N~0_366) (not (= (ite (and (< v_~q_front~0_848 v_~q_back~0_983) (< v_~q_front~0_848 v_~n~0_484) (<= 0 v_~q_front~0_848)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|) (= (+ .cse3 .cse4 v_~s~0_773 |v_thread2Thread1of1ForFork1_~j~0#1_505|) v_~s~0_771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (= (select .cse0 (+ (* 4 v_~q_front~0_846) (- 4) v_~q~0.offset_493)) |v_thread2Thread1of1ForFork1_~j~0#1_505|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_493)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_501| 3) (= (ite (and (< v_~q_front~0_846 (+ v_~q_back~0_983 1)) (< v_~q_front~0_846 (+ v_~n~0_484 1)) (<= 1 v_~q_front~0_846)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_505| 0)) (= v_~q_back~0_983 (+ 3 v_~q_back~0_984)) (not (= .cse4 0)) (= (+ 3 v_~q_front~0_848) v_~q_front~0_846)))) InVars {~q_back~0=v_~q_back~0_984, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, ~n~0=v_~n~0_484, ~q~0.offset=v_~q~0.offset_493, ~s~0=v_~s~0_773, ~q_front~0=v_~q_front~0_848} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_505|, ~q_back~0=v_~q_back~0_983, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_461|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_461|, ~q~0.offset=v_~q~0.offset_493, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_334|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_330|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_733|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_484, ~s~0=v_~s~0_771, ~q_front~0=v_~q_front~0_846} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:39,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_733| v_~q~0.base_493)) (.cse5 (* 4 v_~q_front~0_848))) (let ((.cse1 (* v_~q_back~0_984 4)) (.cse3 (select .cse0 (+ .cse5 v_~q~0.offset_493))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_493 4)))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_984))) (and (<= 0 .cse2) (< .cse2 v_~n~0_484))) 1 0) 0)) (< 2 v_~N~0_366) (not (= (ite (and (< v_~q_front~0_848 v_~q_back~0_983) (< v_~q_front~0_848 v_~n~0_484) (<= 0 v_~q_front~0_848)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|) (= (+ .cse3 .cse4 v_~s~0_773 |v_thread2Thread1of1ForFork1_~j~0#1_505|) v_~s~0_771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (= (select .cse0 (+ (* 4 v_~q_front~0_846) (- 4) v_~q~0.offset_493)) |v_thread2Thread1of1ForFork1_~j~0#1_505|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_493)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_501| 3) (= (ite (and (< v_~q_front~0_846 (+ v_~q_back~0_983 1)) (< v_~q_front~0_846 (+ v_~n~0_484 1)) (<= 1 v_~q_front~0_846)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_505| 0)) (= v_~q_back~0_983 (+ 3 v_~q_back~0_984)) (not (= .cse4 0)) (= (+ 3 v_~q_front~0_848) v_~q_front~0_846)))) InVars {~q_back~0=v_~q_back~0_984, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, ~n~0=v_~n~0_484, ~q~0.offset=v_~q~0.offset_493, ~s~0=v_~s~0_773, ~q_front~0=v_~q_front~0_848} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_505|, ~q_back~0=v_~q_back~0_983, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_461|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_461|, ~q~0.offset=v_~q~0.offset_493, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_334|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_330|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_733|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_484, ~s~0=v_~s~0_771, ~q_front~0=v_~q_front~0_846} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:40,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_733| v_~q~0.base_493)) (.cse5 (* 4 v_~q_front~0_848))) (let ((.cse1 (* v_~q_back~0_984 4)) (.cse3 (select .cse0 (+ .cse5 v_~q~0.offset_493))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_493 4)))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_984))) (and (<= 0 .cse2) (< .cse2 v_~n~0_484))) 1 0) 0)) (< 2 v_~N~0_366) (not (= (ite (and (< v_~q_front~0_848 v_~q_back~0_983) (< v_~q_front~0_848 v_~n~0_484) (<= 0 v_~q_front~0_848)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_493 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|) (= (+ .cse3 .cse4 v_~s~0_773 |v_thread2Thread1of1ForFork1_~j~0#1_505|) v_~s~0_771) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (= (select .cse0 (+ (* 4 v_~q_front~0_846) (- 4) v_~q~0.offset_493)) |v_thread2Thread1of1ForFork1_~j~0#1_505|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_493)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (not (= .cse3 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_501| 3) (= (ite (and (< v_~q_front~0_846 (+ v_~q_back~0_983 1)) (< v_~q_front~0_846 (+ v_~n~0_484 1)) (<= 1 v_~q_front~0_846)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_505| 0)) (= v_~q_back~0_983 (+ 3 v_~q_back~0_984)) (not (= .cse4 0)) (= (+ 3 v_~q_front~0_848) v_~q_front~0_846)))) InVars {~q_back~0=v_~q_back~0_984, #memory_int=|v_#memory_int_733|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, ~n~0=v_~n~0_484, ~q~0.offset=v_~q~0.offset_493, ~s~0=v_~s~0_773, ~q_front~0=v_~q_front~0_848} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_505|, ~q_back~0=v_~q_back~0_983, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_461|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_461|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_330|, ~N~0=v_~N~0_366, ~q~0.base=v_~q~0.base_493, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_461|, ~q~0.offset=v_~q~0.offset_493, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_461|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_478|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_334|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_330|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_733|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, ~n~0=v_~n~0_484, ~s~0=v_~s~0_771, ~q_front~0=v_~q_front~0_846} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:40,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_721| v_~q~0.base_485)) (.cse1 (* v_~q_back~0_957 4))) (and (= (select .cse0 (+ (* 4 v_~q_front~0_820) v_~q~0.offset_485)) |v_thread2Thread1of1ForFork1_~j~0#1_485|) (= (+ v_~s~0_742 |v_thread2Thread1of1ForFork1_~j~0#1_485|) v_~s~0_741) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_485)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459| 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_957))) (and (<= 0 .cse2) (< .cse2 v_~n~0_476))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485 4)) 1) 1 0))) (= (+ 1 v_~q_front~0_820) v_~q_front~0_819) (= (+ 3 v_~q_back~0_957) v_~q_back~0_956) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|) (not (= (ite (and (<= 0 v_~q_back~0_957) (< v_~q_back~0_957 v_~n~0_476)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< 2 v_~N~0_358) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_485| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443| (ite (and (<= 0 v_~q_front~0_820) (< v_~q_front~0_820 v_~q_back~0_956) (< v_~q_front~0_820 v_~n~0_476)) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_485)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_957, #memory_int=|v_#memory_int_721|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, ~n~0=v_~n~0_476, ~q~0.offset=v_~q~0.offset_485, ~s~0=v_~s~0_742, ~q_front~0=v_~q_front~0_820} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_485|, ~q_back~0=v_~q_back~0_956, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_443|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_443|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_313|, ~N~0=v_~N~0_358, ~q~0.base=v_~q~0.base_485, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_443|, ~q~0.offset=v_~q~0.offset_485, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_317|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_313|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_721|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_459|, ~n~0=v_~n~0_476, ~s~0=v_~s~0_741, ~q_front~0=v_~q_front~0_819} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:41,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_783| v_~q~0.base_529)) (.cse5 (* 4 v_~q_front~0_931))) (let ((.cse3 (+ v_~n~0_520 1)) (.cse2 (select .cse0 (+ .cse5 v_~q~0.offset_529))) (.cse4 (select .cse0 (+ .cse5 v_~q~0.offset_529 4))) (.cse1 (* v_~q_back~0_1074 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_529)) 1) 1 0) 0)) (not (= .cse2 0)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_529)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_564| 0)) (= (ite (and (<= 1 v_~q_front~0_930) (< v_~q_front~0_930 v_~q_back~0_1072) (< v_~q_front~0_930 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_516|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_532| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_532|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_532| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_529 (* v_~q_back~0_1072 4))) 0) 1 0)) (= (+ v_~q_back~0_1074 4) v_~q_back~0_1072) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_532| 0)) (not (= (ite (and (< v_~q_back~0_1072 .cse3) (<= 1 v_~q_back~0_1072)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_224| 0) (= (+ .cse4 .cse2 v_~s~0_857 |v_thread2Thread1of1ForFork1_~j~0#1_564|) v_~s~0_856) (= |v_thread1Thread1of1ForFork0_~i~0#1_552| 3) (= (select .cse0 (+ (- 4) (* 4 v_~q_front~0_930) v_~q~0.offset_529)) |v_thread2Thread1of1ForFork1_~j~0#1_564|) (not (= .cse4 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_224| 0) (= (+ 3 v_~q_front~0_931) v_~q_front~0_930) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_552| v_~N~0_398)) (< 2 v_~N~0_398) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_529 4)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_931) (< v_~q_front~0_931 v_~n~0_520) (< (+ 1 v_~q_front~0_931) v_~q_back~0_1072)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_516| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_516|)))) InVars {~q_back~0=v_~q_back~0_1074, #memory_int=|v_#memory_int_783|, ~N~0=v_~N~0_398, ~q~0.base=v_~q~0.base_529, ~n~0=v_~n~0_520, ~q~0.offset=v_~q~0.offset_529, ~s~0=v_~s~0_857, ~q_front~0=v_~q_front~0_931} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_564|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_224|, ~q_back~0=v_~q_back~0_1072, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_242|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_516|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_516|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_366|, ~N~0=v_~N~0_398, ~q~0.base=v_~q~0.base_529, ~q~0.offset=v_~q~0.offset_529, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_516|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_516|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_532|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_370|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_366|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_552|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_242|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_532|, #memory_int=|v_#memory_int_783|, ~n~0=v_~n~0_520, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_224|, ~s~0=v_~s~0_856, ~q_front~0=v_~q_front~0_930} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:41,186 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,186 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,186 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,186 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,186 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,186 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse1 (+ 3 v_~q_back~0_1092)) (.cse0 (select |v_#memory_int_789| v_~q~0.base_535)) (.cse2 (* v_~q_back~0_1092 4))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_228| 0) (= (+ 1 v_~q_front~0_943) v_~q_front~0_942) (= |v_thread2Thread1of1ForFork1_~j~0#1_570| (select .cse0 (+ (* 4 v_~q_front~0_943) v_~q~0.offset_535))) (not (= (ite (and (< v_~q_back~0_1092 v_~n~0_526) (<= 0 v_~q_back~0_1092)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~n~0_526)) 1 0) 0)) (< 2 v_~N~0_404) (= (+ v_~s~0_869 |v_thread2Thread1of1ForFork1_~j~0#1_570|) v_~s~0_868) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_544| (ite (= (select .cse0 (+ .cse2 12 v_~q~0.offset_535)) 0) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_522| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_228| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_560| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_522| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_522|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_522| (ite (and (< v_~q_front~0_943 v_~n~0_526) (< v_~q_front~0_943 .cse1) (<= 0 v_~q_front~0_943)) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_560| v_~N~0_404)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_570| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_544| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_544| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_544|) (not (= 0 (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_535)) 1) 1 0))) (= (+ v_~q_back~0_1092 4) v_~q_back~0_1090) (not (= (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_535 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse2 8 v_~q~0.offset_535)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1092, #memory_int=|v_#memory_int_789|, ~N~0=v_~N~0_404, ~q~0.base=v_~q~0.base_535, ~n~0=v_~n~0_526, ~q~0.offset=v_~q~0.offset_535, ~s~0=v_~s~0_869, ~q_front~0=v_~q_front~0_943} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_570|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_228|, ~q_back~0=v_~q_back~0_1090, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_246|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_522|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_522|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_374|, ~N~0=v_~N~0_404, ~q~0.base=v_~q~0.base_535, ~q~0.offset=v_~q~0.offset_535, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_522|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_522|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_544|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_378|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_374|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_560|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_246|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_544|, #memory_int=|v_#memory_int_789|, ~n~0=v_~n~0_526, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_228|, ~s~0=v_~s~0_868, ~q_front~0=v_~q_front~0_942} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:41,757 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,757 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,757 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,757 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,758 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,758 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,758 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,758 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,758 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:41,758 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_731| v_~q~0.base_491)) (.cse5 (* 4 v_~q_front~0_843))) (let ((.cse4 (select .cse2 (+ .cse5 v_~q~0.offset_491))) (.cse3 (* v_~q_back~0_979 4)) (.cse1 (+ 1 v_~q_front~0_843)) (.cse0 (+ 2 v_~q_front~0_843))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_474|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_503| 0)) (= v_~q_back~0_977 (+ v_~q_back~0_979 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| (ite (and (< .cse0 v_~q_back~0_977) (<= 0 .cse1) (< .cse1 v_~n~0_482)) 1 0)) (not (= (ite (= (select .cse2 (+ 8 v_~q~0.offset_491 .cse3)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_474| 0)) (not (= (ite (= (select .cse2 (+ v_~q~0.offset_491 .cse3 4)) 1) 1 0) 0)) (= (+ .cse4 v_~s~0_768 |v_thread2Thread1of1ForFork1_~j~0#1_503|) v_~s~0_767) (= (select .cse2 (+ .cse5 v_~q~0.offset_491 4)) |v_thread2Thread1of1ForFork1_~j~0#1_503|) (not (= .cse4 0)) (not (= (ite (and (< v_~q_back~0_979 v_~n~0_482) (<= 0 v_~q_back~0_979)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ v_~q~0.offset_491 .cse3)) 1) 1 0) 0)) (< 3 v_~N~0_364) (not (= (ite (and (<= 0 v_~q_front~0_843) (< v_~q_front~0_843 v_~n~0_482) (< .cse1 v_~q_back~0_977)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_497| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|) (= .cse0 v_~q_front~0_842) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474| (ite (= (select .cse2 (+ (- 4) v_~q~0.offset_491 (* v_~q_back~0_977 4))) 1) 1 0)) (not (= 0 (ite (and (<= 1 v_~q_back~0_977) (< v_~q_back~0_977 (+ v_~n~0_482 1))) 1 0)))))) InVars {~q_back~0=v_~q_back~0_979, #memory_int=|v_#memory_int_731|, ~N~0=v_~N~0_364, ~q~0.base=v_~q~0.base_491, ~n~0=v_~n~0_482, ~q~0.offset=v_~q~0.offset_491, ~s~0=v_~s~0_768, ~q_front~0=v_~q_front~0_843} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_503|, ~q_back~0=v_~q_back~0_977, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_326|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_459|, ~N~0=v_~N~0_364, ~q~0.base=v_~q~0.base_491, ~q~0.offset=v_~q~0.offset_491, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_459|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_474|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_330|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_326|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_497|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_474|, #memory_int=|v_#memory_int_731|, ~n~0=v_~n~0_482, ~s~0=v_~s~0_767, ~q_front~0=v_~q_front~0_842} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:42,277 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,277 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,277 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,277 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,277 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,278 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,755 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,755 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,755 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,755 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,755 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:42,755 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:43,177 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:42:43,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3971 [2022-12-06 05:42:43,177 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 355 transitions, 8964 flow [2022-12-06 05:42:43,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:43,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:43,178 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:43,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-12-06 05:42:43,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-12-06 05:42:43,384 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:43,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash -895653803, now seen corresponding path program 1 times [2022-12-06 05:42:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:43,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804303171] [2022-12-06 05:42:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804303171] [2022-12-06 05:42:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804303171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270249294] [2022-12-06 05:42:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:43,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:43,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:43,817 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:43,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-06 05:42:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:44,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:42:44,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:44,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:44,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:42:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:42:44,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:42:44,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270249294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:44,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:42:44,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-12-06 05:42:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826602405] [2022-12-06 05:42:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:44,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:42:44,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:44,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:42:44,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:42:44,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-06 05:42:44,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 355 transitions, 8964 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:42:44,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:44,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-06 05:42:44,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:44,598 INFO L130 PetriNetUnfolder]: 1175/2175 cut-off events. [2022-12-06 05:42:44,598 INFO L131 PetriNetUnfolder]: For 84188/84239 co-relation queries the response was YES. [2022-12-06 05:42:44,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22235 conditions, 2175 events. 1175/2175 cut-off events. For 84188/84239 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13326 event pairs, 216 based on Foata normal form. 28/2203 useless extension candidates. Maximal degree in co-relation 22064. Up to 1632 conditions per place. [2022-12-06 05:42:44,618 INFO L137 encePairwiseOnDemand]: 18/53 looper letters, 255 selfloop transitions, 123 changer transitions 1/380 dead transitions. [2022-12-06 05:42:44,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 380 transitions, 10124 flow [2022-12-06 05:42:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:42:44,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3113207547169811 [2022-12-06 05:42:44,619 INFO L175 Difference]: Start difference. First operand has 210 places, 355 transitions, 8964 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:42:44,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 380 transitions, 10124 flow [2022-12-06 05:42:44,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 380 transitions, 9934 flow, removed 37 selfloop flow, removed 11 redundant places. [2022-12-06 05:42:44,860 INFO L231 Difference]: Finished difference. Result has 203 places, 363 transitions, 9314 flow [2022-12-06 05:42:44,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=8649, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9314, PETRI_PLACES=203, PETRI_TRANSITIONS=363} [2022-12-06 05:42:44,860 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2022-12-06 05:42:44,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:44,860 INFO L89 Accepts]: Start accepts. Operand has 203 places, 363 transitions, 9314 flow [2022-12-06 05:42:44,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:44,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:44,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 363 transitions, 9314 flow [2022-12-06 05:42:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 363 transitions, 9314 flow [2022-12-06 05:42:44,997 INFO L130 PetriNetUnfolder]: 315/937 cut-off events. [2022-12-06 05:42:44,997 INFO L131 PetriNetUnfolder]: For 34708/35062 co-relation queries the response was YES. [2022-12-06 05:42:45,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 937 events. 315/937 cut-off events. For 34708/35062 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7038 event pairs, 7 based on Foata normal form. 122/1055 useless extension candidates. Maximal degree in co-relation 8418. Up to 306 conditions per place. [2022-12-06 05:42:45,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 363 transitions, 9314 flow [2022-12-06 05:42:45,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 05:42:45,009 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:45,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 05:42:45,010 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 363 transitions, 9314 flow [2022-12-06 05:42:45,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:42:45,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:45,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:45,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:45,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-12-06 05:42:45,215 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash -146888503, now seen corresponding path program 1 times [2022-12-06 05:42:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:45,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073098108] [2022-12-06 05:42:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:45,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073098108] [2022-12-06 05:42:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073098108] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944542772] [2022-12-06 05:42:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:45,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:45,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:45,766 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:45,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-06 05:42:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:45,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:42:45,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:46,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:46,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 05:42:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:46,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:46,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:46,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 150 [2022-12-06 05:42:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:46,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944542772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:46,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:46,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-12-06 05:42:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53082498] [2022-12-06 05:42:46,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:46,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:42:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:42:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:42:46,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 05:42:46,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 363 transitions, 9314 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:46,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:46,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 05:42:46,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:46,999 INFO L130 PetriNetUnfolder]: 1180/2189 cut-off events. [2022-12-06 05:42:46,999 INFO L131 PetriNetUnfolder]: For 83558/83633 co-relation queries the response was YES. [2022-12-06 05:42:47,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22761 conditions, 2189 events. 1180/2189 cut-off events. For 83558/83633 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13567 event pairs, 360 based on Foata normal form. 15/2202 useless extension candidates. Maximal degree in co-relation 22257. Up to 2102 conditions per place. [2022-12-06 05:42:47,014 INFO L137 encePairwiseOnDemand]: 26/50 looper letters, 344 selfloop transitions, 32 changer transitions 2/379 dead transitions. [2022-12-06 05:42:47,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 379 transitions, 10237 flow [2022-12-06 05:42:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:42:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:42:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 05:42:47,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 05:42:47,015 INFO L175 Difference]: Start difference. First operand has 201 places, 363 transitions, 9314 flow. Second operand 6 states and 75 transitions. [2022-12-06 05:42:47,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 379 transitions, 10237 flow [2022-12-06 05:42:47,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 379 transitions, 10040 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 05:42:47,209 INFO L231 Difference]: Finished difference. Result has 204 places, 365 transitions, 9263 flow [2022-12-06 05:42:47,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9122, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9263, PETRI_PLACES=204, PETRI_TRANSITIONS=365} [2022-12-06 05:42:47,210 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 183 predicate places. [2022-12-06 05:42:47,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:47,210 INFO L89 Accepts]: Start accepts. Operand has 204 places, 365 transitions, 9263 flow [2022-12-06 05:42:47,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:47,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:47,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 365 transitions, 9263 flow [2022-12-06 05:42:47,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 365 transitions, 9263 flow [2022-12-06 05:42:47,335 INFO L130 PetriNetUnfolder]: 316/944 cut-off events. [2022-12-06 05:42:47,336 INFO L131 PetriNetUnfolder]: For 34842/35233 co-relation queries the response was YES. [2022-12-06 05:42:47,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8590 conditions, 944 events. 316/944 cut-off events. For 34842/35233 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7154 event pairs, 8 based on Foata normal form. 118/1058 useless extension candidates. Maximal degree in co-relation 8384. Up to 309 conditions per place. [2022-12-06 05:42:47,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 365 transitions, 9263 flow [2022-12-06 05:42:47,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-06 05:42:47,366 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:47,366 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:47,451 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:47,452 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:48,118 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:42:48,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 908 [2022-12-06 05:42:48,119 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 363 transitions, 9217 flow [2022-12-06 05:42:48,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:48,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:48,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:48,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:48,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:48,320 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash -871536968, now seen corresponding path program 1 times [2022-12-06 05:42:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:48,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478861135] [2022-12-06 05:42:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:48,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478861135] [2022-12-06 05:42:48,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478861135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:48,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:48,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046898287] [2022-12-06 05:42:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:48,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:48,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 05:42:48,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 363 transitions, 9217 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:48,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:48,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 05:42:48,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:48,997 INFO L130 PetriNetUnfolder]: 1207/2252 cut-off events. [2022-12-06 05:42:48,997 INFO L131 PetriNetUnfolder]: For 82471/82547 co-relation queries the response was YES. [2022-12-06 05:42:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23041 conditions, 2252 events. 1207/2252 cut-off events. For 82471/82547 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14111 event pairs, 223 based on Foata normal form. 84/2336 useless extension candidates. Maximal degree in co-relation 22926. Up to 1961 conditions per place. [2022-12-06 05:42:49,017 INFO L137 encePairwiseOnDemand]: 23/50 looper letters, 297 selfloop transitions, 93 changer transitions 1/392 dead transitions. [2022-12-06 05:42:49,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 392 transitions, 10484 flow [2022-12-06 05:42:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 05:42:49,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 05:42:49,018 INFO L175 Difference]: Start difference. First operand has 202 places, 363 transitions, 9217 flow. Second operand 4 states and 75 transitions. [2022-12-06 05:42:49,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 392 transitions, 10484 flow [2022-12-06 05:42:49,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 392 transitions, 10416 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 05:42:49,253 INFO L231 Difference]: Finished difference. Result has 202 places, 379 transitions, 9928 flow [2022-12-06 05:42:49,254 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9046, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9928, PETRI_PLACES=202, PETRI_TRANSITIONS=379} [2022-12-06 05:42:49,254 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 181 predicate places. [2022-12-06 05:42:49,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:49,254 INFO L89 Accepts]: Start accepts. Operand has 202 places, 379 transitions, 9928 flow [2022-12-06 05:42:49,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:49,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:49,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 379 transitions, 9928 flow [2022-12-06 05:42:49,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 379 transitions, 9928 flow [2022-12-06 05:42:49,399 INFO L130 PetriNetUnfolder]: 322/972 cut-off events. [2022-12-06 05:42:49,400 INFO L131 PetriNetUnfolder]: For 37033/37442 co-relation queries the response was YES. [2022-12-06 05:42:49,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 972 events. 322/972 cut-off events. For 37033/37442 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7399 event pairs, 7 based on Foata normal form. 131/1099 useless extension candidates. Maximal degree in co-relation 8838. Up to 314 conditions per place. [2022-12-06 05:42:49,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 379 transitions, 9928 flow [2022-12-06 05:42:49,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 1210 [2022-12-06 05:42:49,413 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:49,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 05:42:49,413 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 379 transitions, 9928 flow [2022-12-06 05:42:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:49,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:49,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 05:42:49,414 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1922154516, now seen corresponding path program 1 times [2022-12-06 05:42:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:49,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886892477] [2022-12-06 05:42:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:50,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886892477] [2022-12-06 05:42:50,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886892477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:50,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058168395] [2022-12-06 05:42:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:50,448 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:50,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-06 05:42:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:50,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 05:42:50,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:50,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:42:50,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:42:50,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:50,751 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 12 [2022-12-06 05:42:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:50,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:50,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:50,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 197 treesize of output 180 [2022-12-06 05:42:50,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:50,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 99 [2022-12-06 05:42:50,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:50,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 99 treesize of output 79 [2022-12-06 05:42:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:51,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058168395] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:51,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:51,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 05:42:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395221258] [2022-12-06 05:42:51,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:51,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:42:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:42:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=255, Unknown=2, NotChecked=0, Total=306 [2022-12-06 05:42:51,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:42:51,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 379 transitions, 9928 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:51,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:51,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:42:51,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:52,192 INFO L130 PetriNetUnfolder]: 1209/2262 cut-off events. [2022-12-06 05:42:52,192 INFO L131 PetriNetUnfolder]: For 82670/82740 co-relation queries the response was YES. [2022-12-06 05:42:52,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23634 conditions, 2262 events. 1209/2262 cut-off events. For 82670/82740 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14167 event pairs, 218 based on Foata normal form. 58/2320 useless extension candidates. Maximal degree in co-relation 23140. Up to 2148 conditions per place. [2022-12-06 05:42:52,211 INFO L137 encePairwiseOnDemand]: 20/48 looper letters, 355 selfloop transitions, 39 changer transitions 6/401 dead transitions. [2022-12-06 05:42:52,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 401 transitions, 10883 flow [2022-12-06 05:42:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:42:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:42:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 05:42:52,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22916666666666666 [2022-12-06 05:42:52,213 INFO L175 Difference]: Start difference. First operand has 202 places, 379 transitions, 9928 flow. Second operand 8 states and 88 transitions. [2022-12-06 05:42:52,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 401 transitions, 10883 flow [2022-12-06 05:42:52,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 401 transitions, 10784 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-06 05:42:52,490 INFO L231 Difference]: Finished difference. Result has 210 places, 380 transitions, 9936 flow [2022-12-06 05:42:52,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9829, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9936, PETRI_PLACES=210, PETRI_TRANSITIONS=380} [2022-12-06 05:42:52,491 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 189 predicate places. [2022-12-06 05:42:52,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:52,491 INFO L89 Accepts]: Start accepts. Operand has 210 places, 380 transitions, 9936 flow [2022-12-06 05:42:52,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:52,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:52,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 380 transitions, 9936 flow [2022-12-06 05:42:52,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 380 transitions, 9936 flow [2022-12-06 05:42:52,630 INFO L130 PetriNetUnfolder]: 322/972 cut-off events. [2022-12-06 05:42:52,630 INFO L131 PetriNetUnfolder]: For 37513/37962 co-relation queries the response was YES. [2022-12-06 05:42:52,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9035 conditions, 972 events. 322/972 cut-off events. For 37513/37962 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7427 event pairs, 6 based on Foata normal form. 128/1097 useless extension candidates. Maximal degree in co-relation 8876. Up to 314 conditions per place. [2022-12-06 05:42:52,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 380 transitions, 9936 flow [2022-12-06 05:42:52,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 05:42:52,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_754| v_~q~0.base_511)) (.cse2 (* 4 v_~q_front~0_899))) (let ((.cse0 (select .cse1 (+ .cse2 v_~q~0.offset_511)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_494| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_494|) (= (+ .cse0 v_~s~0_825 |v_thread2Thread1of1ForFork1_~j~0#1_540|) v_~s~0_823) (not (= (ite (and (< v_~q_front~0_899 v_~n~0_502) (< v_~q_front~0_899 v_~q_back~0_1029) (<= 0 v_~q_front~0_899)) 1 0) 0)) (= (+ 2 v_~q_front~0_899) v_~q_front~0_897) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_540| 0)) (not (= .cse0 0)) (= (select .cse1 (+ .cse2 v_~q~0.offset_511 4)) |v_thread2Thread1of1ForFork1_~j~0#1_540|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_494| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_494| (ite (let ((.cse3 (+ 1 v_~q_front~0_899))) (and (<= 0 .cse3) (< .cse3 v_~q_back~0_1029) (< .cse3 v_~n~0_502))) 1 0))))) InVars {~q_back~0=v_~q_back~0_1029, #memory_int=|v_#memory_int_754|, ~q~0.base=v_~q~0.base_511, ~n~0=v_~n~0_502, ~q~0.offset=v_~q~0.offset_511, ~s~0=v_~s~0_825, ~q_front~0=v_~q_front~0_899} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_494|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_540|, ~q_back~0=v_~q_back~0_1029, #memory_int=|v_#memory_int_754|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_494|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_494|, ~q~0.base=v_~q~0.base_511, ~n~0=v_~n~0_502, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_494|, ~q~0.offset=v_~q~0.offset_511, ~s~0=v_~s~0_823, ~q_front~0=v_~q_front~0_897} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:52,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:52,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 294 [2022-12-06 05:42:52,785 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 379 transitions, 9932 flow [2022-12-06 05:42:52,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:52,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:52,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:52,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-06 05:42:52,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:52,986 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1887146223, now seen corresponding path program 1 times [2022-12-06 05:42:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:52,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127276462] [2022-12-06 05:42:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127276462] [2022-12-06 05:42:53,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127276462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965462872] [2022-12-06 05:42:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:53,632 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:53,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-06 05:42:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:53,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:42:53,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:53,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:53,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 20 [2022-12-06 05:42:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:53,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:54,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:42:54,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 252 [2022-12-06 05:42:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:54,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965462872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:54,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:54,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:42:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970406836] [2022-12-06 05:42:54,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:54,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:42:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:42:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:42:54,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:42:54,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 379 transitions, 9932 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:54,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:54,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:42:54,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:55,068 INFO L130 PetriNetUnfolder]: 1219/2280 cut-off events. [2022-12-06 05:42:55,068 INFO L131 PetriNetUnfolder]: For 84850/84936 co-relation queries the response was YES. [2022-12-06 05:42:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23870 conditions, 2280 events. 1219/2280 cut-off events. For 84850/84936 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14381 event pairs, 262 based on Foata normal form. 58/2338 useless extension candidates. Maximal degree in co-relation 23680. Up to 2147 conditions per place. [2022-12-06 05:42:55,088 INFO L137 encePairwiseOnDemand]: 20/48 looper letters, 343 selfloop transitions, 52 changer transitions 13/409 dead transitions. [2022-12-06 05:42:55,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 409 transitions, 11043 flow [2022-12-06 05:42:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:42:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:42:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-12-06 05:42:55,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20416666666666666 [2022-12-06 05:42:55,089 INFO L175 Difference]: Start difference. First operand has 208 places, 379 transitions, 9932 flow. Second operand 10 states and 98 transitions. [2022-12-06 05:42:55,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 409 transitions, 11043 flow [2022-12-06 05:42:55,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 409 transitions, 10961 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 05:42:55,427 INFO L231 Difference]: Finished difference. Result has 215 places, 381 transitions, 10032 flow [2022-12-06 05:42:55,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9850, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10032, PETRI_PLACES=215, PETRI_TRANSITIONS=381} [2022-12-06 05:42:55,428 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 194 predicate places. [2022-12-06 05:42:55,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:55,428 INFO L89 Accepts]: Start accepts. Operand has 215 places, 381 transitions, 10032 flow [2022-12-06 05:42:55,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:55,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:55,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 381 transitions, 10032 flow [2022-12-06 05:42:55,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 381 transitions, 10032 flow [2022-12-06 05:42:55,568 INFO L130 PetriNetUnfolder]: 322/978 cut-off events. [2022-12-06 05:42:55,569 INFO L131 PetriNetUnfolder]: For 37851/38269 co-relation queries the response was YES. [2022-12-06 05:42:55,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9156 conditions, 978 events. 322/978 cut-off events. For 37851/38269 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7498 event pairs, 9 based on Foata normal form. 127/1101 useless extension candidates. Maximal degree in co-relation 8945. Up to 317 conditions per place. [2022-12-06 05:42:55,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 381 transitions, 10032 flow [2022-12-06 05:42:55,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 1218 [2022-12-06 05:42:55,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:55,694 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:55,694 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:55,694 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:55,694 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:55,694 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:55,694 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:55,931 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:42:55,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 503 [2022-12-06 05:42:55,931 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 379 transitions, 10006 flow [2022-12-06 05:42:55,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:55,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:55,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:55,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:56,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:56,136 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:42:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash -9417030, now seen corresponding path program 1 times [2022-12-06 05:42:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:56,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403073952] [2022-12-06 05:42:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:56,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403073952] [2022-12-06 05:42:56,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403073952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:56,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163153102] [2022-12-06 05:42:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:56,498 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:42:56,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-06 05:42:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:56,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:42:56,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:56,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:56,763 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:42:56,763 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 26 treesize of output 18 [2022-12-06 05:42:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163153102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:56,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:42:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693252570] [2022-12-06 05:42:56,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:56,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:42:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:42:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:42:56,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 05:42:56,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 379 transitions, 10006 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:56,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:56,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 05:42:56,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:57,629 INFO L130 PetriNetUnfolder]: 1220/2272 cut-off events. [2022-12-06 05:42:57,629 INFO L131 PetriNetUnfolder]: For 88192/88268 co-relation queries the response was YES. [2022-12-06 05:42:57,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23880 conditions, 2272 events. 1220/2272 cut-off events. For 88192/88268 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14332 event pairs, 218 based on Foata normal form. 72/2344 useless extension candidates. Maximal degree in co-relation 23415. Up to 1844 conditions per place. [2022-12-06 05:42:57,650 INFO L137 encePairwiseOnDemand]: 15/49 looper letters, 307 selfloop transitions, 119 changer transitions 0/427 dead transitions. [2022-12-06 05:42:57,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 427 transitions, 11532 flow [2022-12-06 05:42:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:42:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:42:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-12-06 05:42:57,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21224489795918366 [2022-12-06 05:42:57,651 INFO L175 Difference]: Start difference. First operand has 211 places, 379 transitions, 10006 flow. Second operand 10 states and 104 transitions. [2022-12-06 05:42:57,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 427 transitions, 11532 flow [2022-12-06 05:42:57,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 427 transitions, 11335 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-12-06 05:42:57,961 INFO L231 Difference]: Finished difference. Result has 217 places, 387 transitions, 10379 flow [2022-12-06 05:42:57,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9811, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10379, PETRI_PLACES=217, PETRI_TRANSITIONS=387} [2022-12-06 05:42:57,962 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 196 predicate places. [2022-12-06 05:42:57,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:57,962 INFO L89 Accepts]: Start accepts. Operand has 217 places, 387 transitions, 10379 flow [2022-12-06 05:42:57,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:57,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:57,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 387 transitions, 10379 flow [2022-12-06 05:42:57,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 387 transitions, 10379 flow [2022-12-06 05:42:58,134 INFO L130 PetriNetUnfolder]: 327/983 cut-off events. [2022-12-06 05:42:58,134 INFO L131 PetriNetUnfolder]: For 40338/40764 co-relation queries the response was YES. [2022-12-06 05:42:58,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9347 conditions, 983 events. 327/983 cut-off events. For 40338/40764 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7559 event pairs, 6 based on Foata normal form. 126/1106 useless extension candidates. Maximal degree in co-relation 9128. Up to 314 conditions per place. [2022-12-06 05:42:58,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 387 transitions, 10379 flow [2022-12-06 05:42:58,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 05:42:58,152 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,152 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,152 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,152 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [810] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_815| v_~q~0.base_555)) (.cse2 (* v_~q_back~0_1145 4))) (and (not (= (ite (and (<= 0 v_~q_back~0_1145) (< v_~q_back~0_1145 v_~n~0_546)) 1 0) 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_1145))) (and (<= 0 .cse0) (< .cse0 v_~n~0_546))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_578| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_578| (ite (= (select .cse1 (+ 8 v_~q~0.offset_555 .cse2)) 1) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_591| (+ v_~N~0_422 1)) (= (+ 3 v_~q_back~0_1145) v_~q_back~0_1143) (= |v_thread1Thread1of1ForFork0_~i~0#1_591| 3) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_555 4 .cse2)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_578| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_578|) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_555 .cse2)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1145, #memory_int=|v_#memory_int_815|, ~N~0=v_~N~0_422, ~q~0.base=v_~q~0.base_555, ~n~0=v_~n~0_546, ~q~0.offset=v_~q~0.offset_555} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_578|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_403|, ~q_back~0=v_~q_back~0_1143, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_399|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_591|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_578|, #memory_int=|v_#memory_int_815|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_399|, ~N~0=v_~N~0_422, ~q~0.base=v_~q~0.base_555, ~n~0=v_~n~0_546, ~q~0.offset=v_~q~0.offset_555} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:58,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [783] L92-3-->L47-4: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_230| |v_#pthreadsForks_299|) (= |v_thread1Thread1of1ForFork0_~i~0#1_534| (+ |v_thread1Thread1of1ForFork0_~i~0#1_535| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_513|) (< |v_thread1Thread1of1ForFork0_~i~0#1_535| v_~N~0_388) (= (ite (= (select (select |v_#memory_int_764| v_~q~0.base_519) (+ (* v_~q_back~0_1044 4) v_~q~0.offset_519)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_513| 0)) (= (+ v_~q_back~0_1044 1) v_~q_back~0_1043) (not (= (ite (and (<= 0 v_~q_back~0_1044) (< v_~q_back~0_1044 v_~n~0_510)) 1 0) 0)) (= |v_#pthreadsForks_298| (+ |v_#pthreadsForks_299| 1)) (= (store |v_#memory_int_765| |v_ULTIMATE.start_main_~#t2~0#1.base_155| (store (select |v_#memory_int_765| |v_ULTIMATE.start_main_~#t2~0#1.base_155|) |v_ULTIMATE.start_main_~#t2~0#1.offset_152| |v_ULTIMATE.start_main_#t~pre14#1_230|)) |v_#memory_int_764|)) InVars {~q_back~0=v_~q_back~0_1044, #pthreadsForks=|v_#pthreadsForks_299|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_535|, #memory_int=|v_#memory_int_765|, ~N~0=v_~N~0_388, ~q~0.base=v_~q~0.base_519, ~n~0=v_~n~0_510, ~q~0.offset=v_~q~0.offset_519, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_155|} OutVars{~q_back~0=v_~q_back~0_1043, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_152|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_353|, ~N~0=v_~N~0_388, ~q~0.base=v_~q~0.base_519, ~q~0.offset=v_~q~0.offset_519, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_225|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_357|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_230|, #pthreadsForks=|v_#pthreadsForks_298|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_353|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_534|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_513|, #memory_int=|v_#memory_int_764|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_184|, ~n~0=v_~n~0_510, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_155|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:42:58,570 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,570 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,570 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,570 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:58,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:42:58,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [782] L92-3-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|) (not (= (ite (and (<= 0 v_~q_back~0_1040) (< v_~q_back~0_1040 v_~n~0_508)) 1 0) 0)) (= (+ |v_#pthreadsForks_295| 1) |v_#pthreadsForks_294|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_532| v_~N~0_386)) (= |v_thread1Thread1of1ForFork0_#res#1.base_214| 0) (= (+ v_~q_back~0_1040 1) v_~q_back~0_1039) (= (store |v_#memory_int_761| |v_ULTIMATE.start_main_~#t2~0#1.base_153| (store (select |v_#memory_int_761| |v_ULTIMATE.start_main_~#t2~0#1.base_153|) |v_ULTIMATE.start_main_~#t2~0#1.offset_150| |v_ULTIMATE.start_main_#t~pre14#1_228|)) |v_#memory_int_760|) (= (ite (= (select (select |v_#memory_int_760| v_~q~0.base_517) (+ (* v_~q_back~0_1040 4) v_~q~0.offset_517)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_214| 0) (= |v_ULTIMATE.start_main_#t~pre14#1_228| |v_#pthreadsForks_295|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511| 0))) InVars {~q_back~0=v_~q_back~0_1040, #pthreadsForks=|v_#pthreadsForks_295|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_150|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_532|, #memory_int=|v_#memory_int_761|, ~N~0=v_~N~0_386, ~q~0.base=v_~q~0.base_517, ~n~0=v_~n~0_508, ~q~0.offset=v_~q~0.offset_517, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_153|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_214|, ~q_back~0=v_~q_back~0_1039, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_232|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_150|, ~N~0=v_~N~0_386, ~q~0.base=v_~q~0.base_517, ~q~0.offset=v_~q~0.offset_517, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_223|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_228|, #pthreadsForks=|v_#pthreadsForks_294|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_532|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_232|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_511|, #memory_int=|v_#memory_int_760|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_182|, ~n~0=v_~n~0_508, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_153|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_214|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:42:59,139 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:59,139 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:59,139 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:59,139 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:42:59,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_482| v_~q~0.base_331))) (and (not (= (ite (and (< v_~q_back~0_652 (+ v_~n~0_340 1)) (<= 1 v_~q_back~0_652)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_654 v_~n~0_340) (<= 0 v_~q_back~0_654)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_331 (* v_~q_back~0_654 4))) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_303| 2) (= (ite (= (select .cse0 (+ (* v_~q_back~0_652 4) (- 4) v_~q~0.offset_331)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= (+ 2 v_~q_back~0_654) v_~q_back~0_652) (< |v_thread1Thread1of1ForFork0_~i~0#1_303| (+ v_~N~0_244 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|))) InVars {~q_back~0=v_~q_back~0_654, #memory_int=|v_#memory_int_482|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_291|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_203|, ~q_back~0=v_~q_back~0_652, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_199|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_199|, ~N~0=v_~N~0_244, ~q~0.base=v_~q~0.base_331, ~n~0=v_~n~0_340, ~q~0.offset=v_~q~0.offset_331} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:43:00,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_839| v_~q~0.base_571)) (.cse1 (* v_~q_front~0_1019 4))) (let ((.cse2 (* v_~q_back~0_1187 4)) (.cse4 (select .cse0 (+ .cse1 v_~q~0.offset_571)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_252| 0) (= (select .cse0 (+ .cse1 v_~q~0.offset_571 4)) |v_thread2Thread1of1ForFork1_~j~0#1_624|) (= |v_thread1Thread1of1ForFork0_#res#1.base_252| 0) (not (= (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_571 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse3 (+ v_~q_back~0_1187 4))) (and (<= 0 .cse3) (< .cse3 v_~n~0_562))) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse2 v_~q~0.offset_571)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_604| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_624| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_604| (ite (= (select .cse0 (+ .cse2 16 v_~q~0.offset_571)) 0) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_613| v_~N~0_438)) (not (= (ite (= (select .cse0 (+ .cse2 12 v_~q~0.offset_571)) 1) 1 0) 0)) (= v_~q_front~0_1018 (+ v_~q_front~0_1019 2)) (= (+ .cse4 v_~s~0_947 |v_thread2Thread1of1ForFork1_~j~0#1_624|) v_~s~0_946) (not (= 0 (ite (= (select .cse0 (+ .cse2 8 v_~q~0.offset_571)) 1) 1 0))) (not (= 0 (ite (and (<= 0 v_~q_back~0_1187) (< v_~q_back~0_1187 v_~n~0_562)) 1 0))) (not (= (ite (and (< v_~q_front~0_1019 v_~n~0_562) (<= 0 v_~q_front~0_1019) (< v_~q_front~0_1019 (+ 3 v_~q_back~0_1187))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_613| 4) (not (= .cse4 0)) (< 3 v_~N~0_438) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572| 0)) (= (ite (let ((.cse5 (+ v_~q_front~0_1019 1))) (and (< .cse5 v_~n~0_562) (<= 0 .cse5) (< v_~q_front~0_1019 (+ 2 v_~q_back~0_1187)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572|) (= (+ 5 v_~q_back~0_1187) v_~q_back~0_1185)))) InVars {~q_back~0=v_~q_back~0_1187, #memory_int=|v_#memory_int_839|, ~N~0=v_~N~0_438, ~q~0.base=v_~q~0.base_571, ~n~0=v_~n~0_562, ~q~0.offset=v_~q~0.offset_571, ~s~0=v_~s~0_947, ~q_front~0=v_~q_front~0_1019} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_624|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_252|, ~q_back~0=v_~q_back~0_1185, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_270|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_572|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_421|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_572|, ~N~0=v_~N~0_438, ~q~0.base=v_~q~0.base_571, ~q~0.offset=v_~q~0.offset_571, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_572|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_572|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_604|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_425|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_421|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_613|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604|, #memory_int=|v_#memory_int_839|, ~n~0=v_~n~0_562, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_252|, ~s~0=v_~s~0_946, ~q_front~0=v_~q_front~0_1018} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:43:00,106 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,106 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:00,107 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:01,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (+ 1 v_~q_front~0_834)) (.cse1 (select |v_#memory_int_727| v_~q~0.base_489)) (.cse2 (* v_~q_back~0_969 4))) (and (= .cse0 v_~q_front~0_833) (< |v_thread1Thread1of1ForFork0_~i~0#1_489| (+ v_~N~0_362 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466| (ite (= (select .cse1 (+ (* v_~q_back~0_967 4) (- 4) v_~q~0.offset_489)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_496| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_489| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453| (ite (and (<= 0 v_~q_front~0_834) (< .cse0 v_~q_back~0_967) (< v_~q_front~0_834 v_~n~0_480)) 1 0)) (= (+ v_~q_back~0_969 4) v_~q_back~0_967) (not (= (ite (and (< v_~q_back~0_967 (+ v_~n~0_480 1)) (<= 1 v_~q_back~0_967)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_489 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_489)) 1) 1 0) 0)) (= (select .cse1 (+ (* 4 v_~q_front~0_834) v_~q~0.offset_489)) |v_thread2Thread1of1ForFork1_~j~0#1_496|) (not (= (ite (and (< v_~q_back~0_969 v_~n~0_480) (<= 0 v_~q_back~0_969)) 1 0) 0)) (= (+ v_~s~0_758 |v_thread2Thread1of1ForFork1_~j~0#1_496|) v_~s~0_757) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|) (not (= (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_489)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466| 0)))) InVars {~q_back~0=v_~q_back~0_969, #memory_int=|v_#memory_int_727|, ~N~0=v_~N~0_362, ~q~0.base=v_~q~0.base_489, ~n~0=v_~n~0_480, ~q~0.offset=v_~q~0.offset_489, ~s~0=v_~s~0_758, ~q_front~0=v_~q_front~0_834} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_496|, ~q_back~0=v_~q_back~0_967, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_319|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_453|, ~N~0=v_~N~0_362, ~q~0.base=v_~q~0.base_489, ~q~0.offset=v_~q~0.offset_489, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_453|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_466|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_323|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_319|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_489|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_466|, #memory_int=|v_#memory_int_727|, ~n~0=v_~n~0_480, ~s~0=v_~s~0_757, ~q_front~0=v_~q_front~0_833} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:43:01,663 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:01,664 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:01,664 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:01,664 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:02,066 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:02,066 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:02,066 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:02,066 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:02,228 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:43:02,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4267 [2022-12-06 05:43:02,229 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 383 transitions, 10553 flow [2022-12-06 05:43:02,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:02,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:02,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:02,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:02,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:02,434 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1301525743, now seen corresponding path program 1 times [2022-12-06 05:43:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:02,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259321682] [2022-12-06 05:43:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:02,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:02,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259321682] [2022-12-06 05:43:02,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259321682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:02,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:02,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:43:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681512865] [2022-12-06 05:43:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:02,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:43:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:43:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:43:02,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-06 05:43:02,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 383 transitions, 10553 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:43:02,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:02,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-06 05:43:02,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:03,109 INFO L130 PetriNetUnfolder]: 1229/2304 cut-off events. [2022-12-06 05:43:03,110 INFO L131 PetriNetUnfolder]: For 99592/99668 co-relation queries the response was YES. [2022-12-06 05:43:03,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24697 conditions, 2304 events. 1229/2304 cut-off events. For 99592/99668 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14729 event pairs, 325 based on Foata normal form. 22/2326 useless extension candidates. Maximal degree in co-relation 23824. Up to 1969 conditions per place. [2022-12-06 05:43:03,131 INFO L137 encePairwiseOnDemand]: 20/57 looper letters, 290 selfloop transitions, 112 changer transitions 1/404 dead transitions. [2022-12-06 05:43:03,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 404 transitions, 11640 flow [2022-12-06 05:43:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:43:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:43:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 05:43:03,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-06 05:43:03,132 INFO L175 Difference]: Start difference. First operand has 213 places, 383 transitions, 10553 flow. Second operand 4 states and 80 transitions. [2022-12-06 05:43:03,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 404 transitions, 11640 flow [2022-12-06 05:43:03,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 404 transitions, 11183 flow, removed 151 selfloop flow, removed 9 redundant places. [2022-12-06 05:43:03,404 INFO L231 Difference]: Finished difference. Result has 209 places, 391 transitions, 10708 flow [2022-12-06 05:43:03,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=10078, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10708, PETRI_PLACES=209, PETRI_TRANSITIONS=391} [2022-12-06 05:43:03,404 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-06 05:43:03,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:03,404 INFO L89 Accepts]: Start accepts. Operand has 209 places, 391 transitions, 10708 flow [2022-12-06 05:43:03,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:03,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:03,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 391 transitions, 10708 flow [2022-12-06 05:43:03,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 391 transitions, 10708 flow [2022-12-06 05:43:03,544 INFO L130 PetriNetUnfolder]: 331/999 cut-off events. [2022-12-06 05:43:03,545 INFO L131 PetriNetUnfolder]: For 40867/41346 co-relation queries the response was YES. [2022-12-06 05:43:03,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9534 conditions, 999 events. 331/999 cut-off events. For 40867/41346 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7752 event pairs, 6 based on Foata normal form. 147/1143 useless extension candidates. Maximal degree in co-relation 9239. Up to 317 conditions per place. [2022-12-06 05:43:03,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 391 transitions, 10708 flow [2022-12-06 05:43:03,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 05:43:03,556 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:03,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 05:43:03,558 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 391 transitions, 10708 flow [2022-12-06 05:43:03,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:43:03,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:03,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:03,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-06 05:43:03,558 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 775814487, now seen corresponding path program 1 times [2022-12-06 05:43:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:03,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400230801] [2022-12-06 05:43:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:04,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400230801] [2022-12-06 05:43:04,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400230801] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:04,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475074366] [2022-12-06 05:43:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:04,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:04,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:04,607 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:04,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-06 05:43:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:04,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:43:04,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:04,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:04,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 20 [2022-12-06 05:43:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:04,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:05,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:05,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 252 [2022-12-06 05:43:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:05,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475074366] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:05,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:05,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-12-06 05:43:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151937762] [2022-12-06 05:43:05,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:05,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:43:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:05,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:43:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:43:05,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 05:43:05,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 391 transitions, 10708 flow. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:05,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:05,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 05:43:05,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:06,090 INFO L130 PetriNetUnfolder]: 1234/2310 cut-off events. [2022-12-06 05:43:06,090 INFO L131 PetriNetUnfolder]: For 94622/94714 co-relation queries the response was YES. [2022-12-06 05:43:06,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24760 conditions, 2310 events. 1234/2310 cut-off events. For 94622/94714 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14560 event pairs, 381 based on Foata normal form. 16/2326 useless extension candidates. Maximal degree in co-relation 24066. Up to 2224 conditions per place. [2022-12-06 05:43:06,111 INFO L137 encePairwiseOnDemand]: 22/55 looper letters, 363 selfloop transitions, 40 changer transitions 2/406 dead transitions. [2022-12-06 05:43:06,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 406 transitions, 11661 flow [2022-12-06 05:43:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:43:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:43:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 05:43:06,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24242424242424243 [2022-12-06 05:43:06,112 INFO L175 Difference]: Start difference. First operand has 208 places, 391 transitions, 10708 flow. Second operand 6 states and 80 transitions. [2022-12-06 05:43:06,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 406 transitions, 11661 flow [2022-12-06 05:43:06,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 406 transitions, 11578 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:43:06,437 INFO L231 Difference]: Finished difference. Result has 211 places, 392 transitions, 10755 flow [2022-12-06 05:43:06,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=10625, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10755, PETRI_PLACES=211, PETRI_TRANSITIONS=392} [2022-12-06 05:43:06,437 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 05:43:06,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:06,438 INFO L89 Accepts]: Start accepts. Operand has 211 places, 392 transitions, 10755 flow [2022-12-06 05:43:06,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:06,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:06,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 392 transitions, 10755 flow [2022-12-06 05:43:06,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 392 transitions, 10755 flow [2022-12-06 05:43:06,600 INFO L130 PetriNetUnfolder]: 332/1006 cut-off events. [2022-12-06 05:43:06,600 INFO L131 PetriNetUnfolder]: For 40602/41063 co-relation queries the response was YES. [2022-12-06 05:43:06,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9579 conditions, 1006 events. 332/1006 cut-off events. For 40602/41063 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7775 event pairs, 8 based on Foata normal form. 140/1141 useless extension candidates. Maximal degree in co-relation 9285. Up to 320 conditions per place. [2022-12-06 05:43:06,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 392 transitions, 10755 flow [2022-12-06 05:43:06,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 05:43:06,630 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:06,630 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:06,718 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:06,719 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:07,637 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:43:07,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1201 [2022-12-06 05:43:07,638 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 390 transitions, 10709 flow [2022-12-06 05:43:07,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:07,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:07,638 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:07,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-12-06 05:43:07,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-12-06 05:43:07,839 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 439542444, now seen corresponding path program 1 times [2022-12-06 05:43:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:07,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330007144] [2022-12-06 05:43:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330007144] [2022-12-06 05:43:07,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330007144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:07,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:43:07,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:43:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868536885] [2022-12-06 05:43:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:43:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:43:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:43:07,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 05:43:07,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 390 transitions, 10709 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 05:43:07,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:07,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 05:43:07,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:08,692 INFO L130 PetriNetUnfolder]: 1603/2995 cut-off events. [2022-12-06 05:43:08,692 INFO L131 PetriNetUnfolder]: For 124530/124670 co-relation queries the response was YES. [2022-12-06 05:43:08,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32022 conditions, 2995 events. 1603/2995 cut-off events. For 124530/124670 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 20121 event pairs, 84 based on Foata normal form. 113/3108 useless extension candidates. Maximal degree in co-relation 31329. Up to 1051 conditions per place. [2022-12-06 05:43:08,717 INFO L137 encePairwiseOnDemand]: 19/55 looper letters, 161 selfloop transitions, 352 changer transitions 13/527 dead transitions. [2022-12-06 05:43:08,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 527 transitions, 15083 flow [2022-12-06 05:43:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:43:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:43:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 05:43:08,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3151515151515151 [2022-12-06 05:43:08,718 INFO L175 Difference]: Start difference. First operand has 209 places, 390 transitions, 10709 flow. Second operand 6 states and 104 transitions. [2022-12-06 05:43:08,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 527 transitions, 15083 flow [2022-12-06 05:43:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 527 transitions, 14991 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 05:43:09,113 INFO L231 Difference]: Finished difference. Result has 211 places, 481 transitions, 14193 flow [2022-12-06 05:43:09,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=10566, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14193, PETRI_PLACES=211, PETRI_TRANSITIONS=481} [2022-12-06 05:43:09,113 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 05:43:09,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:09,113 INFO L89 Accepts]: Start accepts. Operand has 211 places, 481 transitions, 14193 flow [2022-12-06 05:43:09,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:09,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:09,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 481 transitions, 14193 flow [2022-12-06 05:43:09,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 481 transitions, 14193 flow [2022-12-06 05:43:09,320 INFO L130 PetriNetUnfolder]: 417/1260 cut-off events. [2022-12-06 05:43:09,320 INFO L131 PetriNetUnfolder]: For 52404/53017 co-relation queries the response was YES. [2022-12-06 05:43:09,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12805 conditions, 1260 events. 417/1260 cut-off events. For 52404/53017 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10333 event pairs, 8 based on Foata normal form. 170/1425 useless extension candidates. Maximal degree in co-relation 12622. Up to 451 conditions per place. [2022-12-06 05:43:09,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 481 transitions, 14193 flow [2022-12-06 05:43:09,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 1544 [2022-12-06 05:43:09,337 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:09,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 05:43:09,337 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 481 transitions, 14193 flow [2022-12-06 05:43:09,337 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 05:43:09,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:09,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 05:43:09,338 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1913760305, now seen corresponding path program 1 times [2022-12-06 05:43:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:09,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752013044] [2022-12-06 05:43:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:09,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752013044] [2022-12-06 05:43:09,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752013044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:09,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600969741] [2022-12-06 05:43:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:09,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:09,659 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:09,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-06 05:43:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:09,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:43:09,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:09,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:09,951 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:43:09,951 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 27 treesize of output 16 [2022-12-06 05:43:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:09,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600969741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:09,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:09,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:43:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816406789] [2022-12-06 05:43:09,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:09,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:43:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:43:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:43:09,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-06 05:43:09,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 481 transitions, 14193 flow. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:09,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:09,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-06 05:43:09,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:11,090 INFO L130 PetriNetUnfolder]: 1626/3038 cut-off events. [2022-12-06 05:43:11,090 INFO L131 PetriNetUnfolder]: For 143192/143374 co-relation queries the response was YES. [2022-12-06 05:43:11,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35089 conditions, 3038 events. 1626/3038 cut-off events. For 143192/143374 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 20487 event pairs, 396 based on Foata normal form. 113/3151 useless extension candidates. Maximal degree in co-relation 34602. Up to 2395 conditions per place. [2022-12-06 05:43:11,121 INFO L137 encePairwiseOnDemand]: 18/52 looper letters, 440 selfloop transitions, 134 changer transitions 1/576 dead transitions. [2022-12-06 05:43:11,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 576 transitions, 17294 flow [2022-12-06 05:43:11,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:43:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:43:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2022-12-06 05:43:11,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2202797202797203 [2022-12-06 05:43:11,122 INFO L175 Difference]: Start difference. First operand has 208 places, 481 transitions, 14193 flow. Second operand 11 states and 126 transitions. [2022-12-06 05:43:11,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 576 transitions, 17294 flow [2022-12-06 05:43:11,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 576 transitions, 16132 flow, removed 574 selfloop flow, removed 6 redundant places. [2022-12-06 05:43:11,674 INFO L231 Difference]: Finished difference. Result has 214 places, 496 transitions, 14305 flow [2022-12-06 05:43:11,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=13417, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14305, PETRI_PLACES=214, PETRI_TRANSITIONS=496} [2022-12-06 05:43:11,675 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 193 predicate places. [2022-12-06 05:43:11,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:11,675 INFO L89 Accepts]: Start accepts. Operand has 214 places, 496 transitions, 14305 flow [2022-12-06 05:43:11,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:11,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:11,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 496 transitions, 14305 flow [2022-12-06 05:43:11,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 496 transitions, 14305 flow [2022-12-06 05:43:11,880 INFO L130 PetriNetUnfolder]: 432/1312 cut-off events. [2022-12-06 05:43:11,880 INFO L131 PetriNetUnfolder]: For 52152/52750 co-relation queries the response was YES. [2022-12-06 05:43:11,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12408 conditions, 1312 events. 432/1312 cut-off events. For 52152/52750 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 10957 event pairs, 10 based on Foata normal form. 187/1494 useless extension candidates. Maximal degree in co-relation 11953. Up to 380 conditions per place. [2022-12-06 05:43:11,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 496 transitions, 14305 flow [2022-12-06 05:43:11,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 1602 [2022-12-06 05:43:11,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [817] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_829| v_~q~0.base_565)) (.cse1 (* v_~q_back~0_1171 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_605| (+ v_~N~0_432 1)) (= (+ 3 v_~q_back~0_1171) v_~q_back~0_1169) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_605| 3) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_565)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|) (not (= (ite (and (< v_~q_back~0_1171 v_~n~0_556) (<= 0 v_~q_back~0_1171)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1171))) (and (<= 0 .cse2) (< .cse2 v_~n~0_556))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1171, #memory_int=|v_#memory_int_829|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_417|, ~q_back~0=v_~q_back~0_1169, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_413|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_605|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|, #memory_int=|v_#memory_int_829|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_413|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:43:12,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_845| v_~q~0.base_577)) (.cse3 (* v_~q_front~0_1034 4)) (.cse0 (+ v_~q_front~0_1034 1))) (let ((.cse1 (< .cse0 v_~q_back~0_1201)) (.cse5 (select .cse2 (+ .cse3 v_~q~0.offset_577))) (.cse4 (* v_~q_back~0_1202 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_568) .cse1) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1034) .cse1 (< v_~q_front~0_1034 v_~n~0_568)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|) (< |v_thread1Thread1of1ForFork0_~i~0#1_619| (+ v_~N~0_444 1)) (= (select .cse2 (+ .cse3 v_~q~0.offset_577 4)) |v_thread2Thread1of1ForFork1_~j~0#1_632|) (not (= (ite (and (<= 0 v_~q_back~0_1202) (< v_~q_back~0_1202 v_~n~0_568)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_577)) 1) 1 0) 0)) (= (ite (= 1 (select .cse2 (+ (* v_~q_back~0_1201 4) (- 4) v_~q~0.offset_577))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|) (= (+ .cse5 v_~s~0_962 |v_thread2Thread1of1ForFork1_~j~0#1_632|) v_~s~0_960) (= (+ v_~q_back~0_1202 4) v_~q_back~0_1201) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_619| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614| 0)) (not (= .cse5 0)) (= v_~q_front~0_1032 (+ v_~q_front~0_1034 2)) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_632| 0)) (not (= (ite (and (< v_~q_back~0_1201 (+ v_~n~0_568 1)) (<= 1 v_~q_back~0_1201)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1202, #memory_int=|v_#memory_int_845|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, ~n~0=v_~n~0_568, ~q~0.offset=v_~q~0.offset_577, ~s~0=v_~s~0_962, ~q_front~0=v_~q_front~0_1034} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_632|, ~q_back~0=v_~q_back~0_1201, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_580|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_427|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_580|, ~q~0.offset=v_~q~0.offset_577, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_431|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_427|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_619|, #memory_int=|v_#memory_int_845|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|, ~n~0=v_~n~0_568, ~s~0=v_~s~0_960, ~q_front~0=v_~q_front~0_1032} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:43:12,077 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,077 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,077 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,078 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,078 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,078 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:12,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_845| v_~q~0.base_577)) (.cse3 (* v_~q_front~0_1034 4)) (.cse0 (+ v_~q_front~0_1034 1))) (let ((.cse1 (< .cse0 v_~q_back~0_1201)) (.cse5 (select .cse2 (+ .cse3 v_~q~0.offset_577))) (.cse4 (* v_~q_back~0_1202 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_568) .cse1) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1034) .cse1 (< v_~q_front~0_1034 v_~n~0_568)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|) (< |v_thread1Thread1of1ForFork0_~i~0#1_619| (+ v_~N~0_444 1)) (= (select .cse2 (+ .cse3 v_~q~0.offset_577 4)) |v_thread2Thread1of1ForFork1_~j~0#1_632|) (not (= (ite (and (<= 0 v_~q_back~0_1202) (< v_~q_back~0_1202 v_~n~0_568)) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse4 8 v_~q~0.offset_577)) 1) 1 0) 0)) (= (ite (= 1 (select .cse2 (+ (* v_~q_back~0_1201 4) (- 4) v_~q~0.offset_577))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|) (= (+ .cse5 v_~s~0_962 |v_thread2Thread1of1ForFork1_~j~0#1_632|) v_~s~0_960) (= (+ v_~q_back~0_1202 4) v_~q_back~0_1201) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_619| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614| 0)) (not (= .cse5 0)) (= v_~q_front~0_1032 (+ v_~q_front~0_1034 2)) (not (= (ite (= (select .cse2 (+ .cse4 v_~q~0.offset_577 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_632| 0)) (not (= (ite (and (< v_~q_back~0_1201 (+ v_~n~0_568 1)) (<= 1 v_~q_back~0_1201)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1202, #memory_int=|v_#memory_int_845|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, ~n~0=v_~n~0_568, ~q~0.offset=v_~q~0.offset_577, ~s~0=v_~s~0_962, ~q_front~0=v_~q_front~0_1034} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_632|, ~q_back~0=v_~q_back~0_1201, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_580|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_580|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_427|, ~N~0=v_~N~0_444, ~q~0.base=v_~q~0.base_577, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_580|, ~q~0.offset=v_~q~0.offset_577, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_580|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_614|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_431|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_427|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_619|, #memory_int=|v_#memory_int_845|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_614|, ~n~0=v_~n~0_568, ~s~0=v_~s~0_960, ~q_front~0=v_~q_front~0_1032} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:43:13,108 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,108 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,108 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,108 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,108 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,108 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:13,515 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:43:13,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1841 [2022-12-06 05:43:13,516 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 496 transitions, 14392 flow [2022-12-06 05:43:13,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:13,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:13,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:13,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-12-06 05:43:13,717 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 189133175, now seen corresponding path program 2 times [2022-12-06 05:43:13,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:13,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540602284] [2022-12-06 05:43:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:14,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540602284] [2022-12-06 05:43:14,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540602284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:14,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168784070] [2022-12-06 05:43:14,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:43:14,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:14,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:14,337 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:14,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-06 05:43:14,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:43:14,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:43:14,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 05:43:14,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:14,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:14,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 20 [2022-12-06 05:43:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:14,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:14,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:14,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 252 [2022-12-06 05:43:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:14,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168784070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:14,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:14,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:43:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045634939] [2022-12-06 05:43:14,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:14,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:43:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:43:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:43:14,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 05:43:14,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 496 transitions, 14392 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:14,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:14,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 05:43:14,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:16,273 INFO L130 PetriNetUnfolder]: 1644/3099 cut-off events. [2022-12-06 05:43:16,273 INFO L131 PetriNetUnfolder]: For 125994/126089 co-relation queries the response was YES. [2022-12-06 05:43:16,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33369 conditions, 3099 events. 1644/3099 cut-off events. For 125994/126089 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21040 event pairs, 394 based on Foata normal form. 56/3155 useless extension candidates. Maximal degree in co-relation 32388. Up to 2909 conditions per place. [2022-12-06 05:43:16,299 INFO L137 encePairwiseOnDemand]: 17/56 looper letters, 443 selfloop transitions, 72 changer transitions 16/532 dead transitions. [2022-12-06 05:43:16,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 532 transitions, 15885 flow [2022-12-06 05:43:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:43:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:43:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2022-12-06 05:43:16,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17857142857142858 [2022-12-06 05:43:16,302 INFO L175 Difference]: Start difference. First operand has 214 places, 496 transitions, 14392 flow. Second operand 11 states and 110 transitions. [2022-12-06 05:43:16,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 532 transitions, 15885 flow [2022-12-06 05:43:16,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 532 transitions, 15558 flow, removed 74 selfloop flow, removed 6 redundant places. [2022-12-06 05:43:16,693 INFO L231 Difference]: Finished difference. Result has 222 places, 498 transitions, 14237 flow [2022-12-06 05:43:16,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=14073, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14237, PETRI_PLACES=222, PETRI_TRANSITIONS=498} [2022-12-06 05:43:16,694 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 201 predicate places. [2022-12-06 05:43:16,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:16,694 INFO L89 Accepts]: Start accepts. Operand has 222 places, 498 transitions, 14237 flow [2022-12-06 05:43:16,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:16,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:16,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 498 transitions, 14237 flow [2022-12-06 05:43:16,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 498 transitions, 14237 flow [2022-12-06 05:43:16,889 INFO L130 PetriNetUnfolder]: 430/1303 cut-off events. [2022-12-06 05:43:16,889 INFO L131 PetriNetUnfolder]: For 50472/51083 co-relation queries the response was YES. [2022-12-06 05:43:16,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12355 conditions, 1303 events. 430/1303 cut-off events. For 50472/51083 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 10771 event pairs, 8 based on Foata normal form. 183/1480 useless extension candidates. Maximal degree in co-relation 12105. Up to 374 conditions per place. [2022-12-06 05:43:16,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 498 transitions, 14237 flow [2022-12-06 05:43:16,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 1604 [2022-12-06 05:43:16,905 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:16,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 05:43:16,906 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 498 transitions, 14237 flow [2022-12-06 05:43:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:16,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:16,906 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:16,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:17,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:17,111 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1854699122, now seen corresponding path program 1 times [2022-12-06 05:43:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:17,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595366574] [2022-12-06 05:43:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:17,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:17,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595366574] [2022-12-06 05:43:17,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595366574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:17,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354779527] [2022-12-06 05:43:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:17,410 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:17,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-06 05:43:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:17,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:43:17,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:17,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:17,709 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:43:17,709 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 27 treesize of output 16 [2022-12-06 05:43:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354779527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:17,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:17,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 05:43:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761662634] [2022-12-06 05:43:17,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:17,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:43:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:43:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:43:17,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 05:43:17,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 498 transitions, 14237 flow. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:17,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:17,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 05:43:17,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:19,063 INFO L130 PetriNetUnfolder]: 1788/3317 cut-off events. [2022-12-06 05:43:19,063 INFO L131 PetriNetUnfolder]: For 139472/139561 co-relation queries the response was YES. [2022-12-06 05:43:19,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35715 conditions, 3317 events. 1788/3317 cut-off events. For 139472/139561 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 22489 event pairs, 351 based on Foata normal form. 125/3442 useless extension candidates. Maximal degree in co-relation 35431. Up to 2242 conditions per place. [2022-12-06 05:43:19,097 INFO L137 encePairwiseOnDemand]: 17/55 looper letters, 458 selfloop transitions, 204 changer transitions 0/663 dead transitions. [2022-12-06 05:43:19,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 663 transitions, 18434 flow [2022-12-06 05:43:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:43:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:43:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 166 transitions. [2022-12-06 05:43:19,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17754010695187167 [2022-12-06 05:43:19,108 INFO L175 Difference]: Start difference. First operand has 219 places, 498 transitions, 14237 flow. Second operand 17 states and 166 transitions. [2022-12-06 05:43:19,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 663 transitions, 18434 flow [2022-12-06 05:43:19,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 663 transitions, 18279 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-12-06 05:43:19,645 INFO L231 Difference]: Finished difference. Result has 234 places, 537 transitions, 15952 flow [2022-12-06 05:43:19,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=14098, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=15952, PETRI_PLACES=234, PETRI_TRANSITIONS=537} [2022-12-06 05:43:19,645 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2022-12-06 05:43:19,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:19,645 INFO L89 Accepts]: Start accepts. Operand has 234 places, 537 transitions, 15952 flow [2022-12-06 05:43:19,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:19,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:19,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 537 transitions, 15952 flow [2022-12-06 05:43:19,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 537 transitions, 15952 flow [2022-12-06 05:43:19,876 INFO L130 PetriNetUnfolder]: 471/1418 cut-off events. [2022-12-06 05:43:19,876 INFO L131 PetriNetUnfolder]: For 58768/59448 co-relation queries the response was YES. [2022-12-06 05:43:19,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13856 conditions, 1418 events. 471/1418 cut-off events. For 58768/59448 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 12028 event pairs, 8 based on Foata normal form. 197/1610 useless extension candidates. Maximal degree in co-relation 13439. Up to 425 conditions per place. [2022-12-06 05:43:19,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 537 transitions, 15952 flow [2022-12-06 05:43:19,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 1762 [2022-12-06 05:43:19,894 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:19,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-06 05:43:19,894 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 537 transitions, 15952 flow [2022-12-06 05:43:19,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:19,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:19,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:19,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-06 05:43:20,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-12-06 05:43:20,099 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1751201909, now seen corresponding path program 1 times [2022-12-06 05:43:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:20,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437841071] [2022-12-06 05:43:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:20,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437841071] [2022-12-06 05:43:20,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437841071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:20,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357572636] [2022-12-06 05:43:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:20,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:20,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:20,848 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:20,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-06 05:43:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:21,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:43:21,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:21,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:21,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 20 [2022-12-06 05:43:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:21,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:21,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:21,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 153 treesize of output 255 [2022-12-06 05:43:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:21,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357572636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:21,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:21,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:43:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977312266] [2022-12-06 05:43:21,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:21,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:43:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:21,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:43:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:43:21,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 05:43:21,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 537 transitions, 15952 flow. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:21,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:21,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 05:43:21,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:22,955 INFO L130 PetriNetUnfolder]: 1788/3319 cut-off events. [2022-12-06 05:43:22,955 INFO L131 PetriNetUnfolder]: For 137380/137490 co-relation queries the response was YES. [2022-12-06 05:43:22,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36774 conditions, 3319 events. 1788/3319 cut-off events. For 137380/137490 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 22441 event pairs, 433 based on Foata normal form. 58/3377 useless extension candidates. Maximal degree in co-relation 35721. Up to 3194 conditions per place. [2022-12-06 05:43:22,991 INFO L137 encePairwiseOnDemand]: 17/55 looper letters, 482 selfloop transitions, 62 changer transitions 10/555 dead transitions. [2022-12-06 05:43:22,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 555 transitions, 17182 flow [2022-12-06 05:43:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:43:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:43:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-12-06 05:43:22,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1898989898989899 [2022-12-06 05:43:22,992 INFO L175 Difference]: Start difference. First operand has 234 places, 537 transitions, 15952 flow. Second operand 9 states and 94 transitions. [2022-12-06 05:43:22,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 555 transitions, 17182 flow [2022-12-06 05:43:23,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 555 transitions, 16414 flow, removed 330 selfloop flow, removed 6 redundant places. [2022-12-06 05:43:23,616 INFO L231 Difference]: Finished difference. Result has 236 places, 535 transitions, 15290 flow [2022-12-06 05:43:23,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15179, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15290, PETRI_PLACES=236, PETRI_TRANSITIONS=535} [2022-12-06 05:43:23,617 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 215 predicate places. [2022-12-06 05:43:23,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:23,618 INFO L89 Accepts]: Start accepts. Operand has 236 places, 535 transitions, 15290 flow [2022-12-06 05:43:23,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:23,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:23,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 535 transitions, 15290 flow [2022-12-06 05:43:23,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 535 transitions, 15290 flow [2022-12-06 05:43:23,867 INFO L130 PetriNetUnfolder]: 470/1409 cut-off events. [2022-12-06 05:43:23,868 INFO L131 PetriNetUnfolder]: For 54776/55383 co-relation queries the response was YES. [2022-12-06 05:43:23,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13436 conditions, 1409 events. 470/1409 cut-off events. For 54776/55383 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11827 event pairs, 8 based on Foata normal form. 199/1603 useless extension candidates. Maximal degree in co-relation 12962. Up to 420 conditions per place. [2022-12-06 05:43:23,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 535 transitions, 15290 flow [2022-12-06 05:43:23,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 1756 [2022-12-06 05:43:23,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:23,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 05:43:23,889 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 535 transitions, 15290 flow [2022-12-06 05:43:23,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:23,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:23,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:23,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-12-06 05:43:24,095 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1214053346, now seen corresponding path program 1 times [2022-12-06 05:43:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:24,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289761945] [2022-12-06 05:43:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:24,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289761945] [2022-12-06 05:43:24,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289761945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:24,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342530179] [2022-12-06 05:43:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:24,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:24,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:24,831 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:24,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-06 05:43:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 05:43:25,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:25,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:25,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:43:25,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:25,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 05:43:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:25,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:25,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:25,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 265 [2022-12-06 05:43:25,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:25,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 115 [2022-12-06 05:43:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:25,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342530179] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:25,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:25,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:43:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021601092] [2022-12-06 05:43:25,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:43:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:43:25,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:43:25,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 55 [2022-12-06 05:43:25,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 535 transitions, 15290 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:25,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:25,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 55 [2022-12-06 05:43:25,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:27,173 INFO L130 PetriNetUnfolder]: 1797/3343 cut-off events. [2022-12-06 05:43:27,173 INFO L131 PetriNetUnfolder]: For 130547/130632 co-relation queries the response was YES. [2022-12-06 05:43:27,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35883 conditions, 3343 events. 1797/3343 cut-off events. For 130547/130632 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 22741 event pairs, 289 based on Foata normal form. 75/3418 useless extension candidates. Maximal degree in co-relation 35030. Up to 3163 conditions per place. [2022-12-06 05:43:27,202 INFO L137 encePairwiseOnDemand]: 17/55 looper letters, 484 selfloop transitions, 75 changer transitions 7/567 dead transitions. [2022-12-06 05:43:27,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 567 transitions, 16770 flow [2022-12-06 05:43:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:43:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:43:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-12-06 05:43:27,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-06 05:43:27,203 INFO L175 Difference]: Start difference. First operand has 234 places, 535 transitions, 15290 flow. Second operand 12 states and 108 transitions. [2022-12-06 05:43:27,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 567 transitions, 16770 flow [2022-12-06 05:43:27,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 567 transitions, 16599 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 05:43:27,745 INFO L231 Difference]: Finished difference. Result has 243 places, 541 transitions, 15423 flow [2022-12-06 05:43:27,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15121, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15423, PETRI_PLACES=243, PETRI_TRANSITIONS=541} [2022-12-06 05:43:27,745 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 222 predicate places. [2022-12-06 05:43:27,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:27,745 INFO L89 Accepts]: Start accepts. Operand has 243 places, 541 transitions, 15423 flow [2022-12-06 05:43:27,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:27,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:27,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 541 transitions, 15423 flow [2022-12-06 05:43:27,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 541 transitions, 15423 flow [2022-12-06 05:43:27,971 INFO L130 PetriNetUnfolder]: 472/1419 cut-off events. [2022-12-06 05:43:27,971 INFO L131 PetriNetUnfolder]: For 55969/56616 co-relation queries the response was YES. [2022-12-06 05:43:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13590 conditions, 1419 events. 472/1419 cut-off events. For 55969/56616 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 11960 event pairs, 9 based on Foata normal form. 194/1608 useless extension candidates. Maximal degree in co-relation 13365. Up to 423 conditions per place. [2022-12-06 05:43:27,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 541 transitions, 15423 flow [2022-12-06 05:43:27,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-06 05:43:27,989 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:27,989 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:27,989 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:27,989 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:27,989 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:27,990 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] L65-2-->L47-4: Formula: (let ((.cse1 (select |v_#memory_int_807| v_~q~0.base_549)) (.cse2 (* 4 v_~q_front~0_990))) (let ((.cse0 (select .cse1 (+ v_~q~0.offset_549 .cse2)))) (and (not (= (ite (and (<= 0 v_~q_front~0_990) (< v_~q_front~0_990 v_~n~0_540) (< v_~q_front~0_990 v_~q_back~0_1126)) 1 0) 0)) (not (= .cse0 0)) (= (+ .cse0 v_~s~0_917 |v_thread2Thread1of1ForFork1_~j~0#1_603|) v_~s~0_916) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_578| (+ |v_thread1Thread1of1ForFork0_~i~0#1_579| 1)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_603| 0)) (= (+ 2 v_~q_front~0_990) v_~q_front~0_989) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565| 0)) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1126 4) v_~q~0.offset_549)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|) (= (select .cse1 (+ v_~q~0.offset_549 4 .cse2)) |v_thread2Thread1of1ForFork1_~j~0#1_603|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553| (ite (let ((.cse3 (+ 1 v_~q_front~0_990))) (and (< .cse3 v_~q_back~0_1126) (<= 0 .cse3) (< .cse3 v_~n~0_540))) 1 0)) (not (= (ite (and (<= 0 v_~q_back~0_1126) (< v_~q_back~0_1126 v_~n~0_540)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565|) (< |v_thread1Thread1of1ForFork0_~i~0#1_579| v_~N~0_416) (= (+ v_~q_back~0_1126 1) v_~q_back~0_1125)))) InVars {~q_back~0=v_~q_back~0_1126, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_579|, #memory_int=|v_#memory_int_807|, ~N~0=v_~N~0_416, ~q~0.base=v_~q~0.base_549, ~n~0=v_~n~0_540, ~q~0.offset=v_~q~0.offset_549, ~s~0=v_~s~0_917, ~q_front~0=v_~q_front~0_990} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_603|, ~q_back~0=v_~q_back~0_1125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_553|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_392|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_553|, ~N~0=v_~N~0_416, ~q~0.base=v_~q~0.base_549, ~q~0.offset=v_~q~0.offset_549, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_553|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_553|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_396|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_392|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_578|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_565|, #memory_int=|v_#memory_int_807|, ~n~0=v_~n~0_540, ~s~0=v_~s~0_916, ~q_front~0=v_~q_front~0_989} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:43:28,278 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,279 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,279 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,279 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,279 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,279 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:28,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:43:28,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 815 [2022-12-06 05:43:28,561 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 541 transitions, 15445 flow [2022-12-06 05:43:28,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:28,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:28,561 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:28,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:28,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-12-06 05:43:28,766 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1258570299, now seen corresponding path program 1 times [2022-12-06 05:43:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:28,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378892181] [2022-12-06 05:43:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378892181] [2022-12-06 05:43:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378892181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394153329] [2022-12-06 05:43:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:29,519 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-06 05:43:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:29,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 05:43:29,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:29,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:29,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 20 [2022-12-06 05:43:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:29,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:30,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:30,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 252 [2022-12-06 05:43:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:30,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394153329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:30,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:30,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 05:43:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082221156] [2022-12-06 05:43:30,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:43:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:43:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:43:30,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-06 05:43:30,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 541 transitions, 15445 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:30,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:30,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-06 05:43:30,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:31,493 INFO L130 PetriNetUnfolder]: 1795/3342 cut-off events. [2022-12-06 05:43:31,494 INFO L131 PetriNetUnfolder]: For 128468/128548 co-relation queries the response was YES. [2022-12-06 05:43:31,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36024 conditions, 3342 events. 1795/3342 cut-off events. For 128468/128548 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22663 event pairs, 445 based on Foata normal form. 56/3398 useless extension candidates. Maximal degree in co-relation 35765. Up to 3243 conditions per place. [2022-12-06 05:43:31,526 INFO L137 encePairwiseOnDemand]: 24/57 looper letters, 506 selfloop transitions, 37 changer transitions 15/559 dead transitions. [2022-12-06 05:43:31,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 559 transitions, 16697 flow [2022-12-06 05:43:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:43:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:43:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 05:43:31,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21804511278195488 [2022-12-06 05:43:31,527 INFO L175 Difference]: Start difference. First operand has 242 places, 541 transitions, 15445 flow. Second operand 7 states and 87 transitions. [2022-12-06 05:43:31,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 559 transitions, 16697 flow [2022-12-06 05:43:32,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 559 transitions, 16492 flow, removed 59 selfloop flow, removed 5 redundant places. [2022-12-06 05:43:32,022 INFO L231 Difference]: Finished difference. Result has 244 places, 538 transitions, 15218 flow [2022-12-06 05:43:32,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=15242, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15218, PETRI_PLACES=244, PETRI_TRANSITIONS=538} [2022-12-06 05:43:32,022 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2022-12-06 05:43:32,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:32,022 INFO L89 Accepts]: Start accepts. Operand has 244 places, 538 transitions, 15218 flow [2022-12-06 05:43:32,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:32,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:32,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 538 transitions, 15218 flow [2022-12-06 05:43:32,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 538 transitions, 15218 flow [2022-12-06 05:43:32,274 INFO L130 PetriNetUnfolder]: 471/1414 cut-off events. [2022-12-06 05:43:32,274 INFO L131 PetriNetUnfolder]: For 55206/55843 co-relation queries the response was YES. [2022-12-06 05:43:32,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 1414 events. 471/1414 cut-off events. For 55206/55843 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 11840 event pairs, 9 based on Foata normal form. 188/1598 useless extension candidates. Maximal degree in co-relation 13165. Up to 419 conditions per place. [2022-12-06 05:43:32,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 538 transitions, 15218 flow [2022-12-06 05:43:32,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 1752 [2022-12-06 05:43:32,293 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:32,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 05:43:32,293 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 538 transitions, 15218 flow [2022-12-06 05:43:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:32,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:32,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:32,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:32,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-12-06 05:43:32,501 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -984347154, now seen corresponding path program 1 times [2022-12-06 05:43:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:32,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296403690] [2022-12-06 05:43:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296403690] [2022-12-06 05:43:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296403690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992053367] [2022-12-06 05:43:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:32,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:32,847 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:32,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-06 05:43:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:33,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:43:33,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:33,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:33,186 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:43:33,186 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 25 treesize of output 16 [2022-12-06 05:43:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:33,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992053367] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:33,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-06 05:43:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407138920] [2022-12-06 05:43:33,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:33,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:43:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:33,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:43:33,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:43:33,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-06 05:43:33,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 538 transitions, 15218 flow. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:33,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:33,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-06 05:43:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:34,484 INFO L130 PetriNetUnfolder]: 1863/3452 cut-off events. [2022-12-06 05:43:34,484 INFO L131 PetriNetUnfolder]: For 138416/138510 co-relation queries the response was YES. [2022-12-06 05:43:34,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36997 conditions, 3452 events. 1863/3452 cut-off events. For 138416/138510 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 23527 event pairs, 354 based on Foata normal form. 90/3542 useless extension candidates. Maximal degree in co-relation 36404. Up to 2786 conditions per place. [2022-12-06 05:43:34,512 INFO L137 encePairwiseOnDemand]: 15/56 looper letters, 433 selfloop transitions, 180 changer transitions 0/614 dead transitions. [2022-12-06 05:43:34,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 614 transitions, 17750 flow [2022-12-06 05:43:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:43:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:43:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2022-12-06 05:43:34,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17708333333333334 [2022-12-06 05:43:34,513 INFO L175 Difference]: Start difference. First operand has 241 places, 538 transitions, 15218 flow. Second operand 12 states and 119 transitions. [2022-12-06 05:43:34,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 614 transitions, 17750 flow [2022-12-06 05:43:35,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 614 transitions, 17643 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:43:35,037 INFO L231 Difference]: Finished difference. Result has 252 places, 564 transitions, 16390 flow [2022-12-06 05:43:35,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=15113, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16390, PETRI_PLACES=252, PETRI_TRANSITIONS=564} [2022-12-06 05:43:35,037 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 231 predicate places. [2022-12-06 05:43:35,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:35,037 INFO L89 Accepts]: Start accepts. Operand has 252 places, 564 transitions, 16390 flow [2022-12-06 05:43:35,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:35,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:35,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 564 transitions, 16390 flow [2022-12-06 05:43:35,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 564 transitions, 16390 flow [2022-12-06 05:43:35,283 INFO L130 PetriNetUnfolder]: 493/1474 cut-off events. [2022-12-06 05:43:35,283 INFO L131 PetriNetUnfolder]: For 60894/61531 co-relation queries the response was YES. [2022-12-06 05:43:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14434 conditions, 1474 events. 493/1474 cut-off events. For 60894/61531 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12524 event pairs, 9 based on Foata normal form. 199/1669 useless extension candidates. Maximal degree in co-relation 14028. Up to 439 conditions per place. [2022-12-06 05:43:35,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 564 transitions, 16390 flow [2022-12-06 05:43:35,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-06 05:43:35,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_817| v_~q~0.base_557)) (.cse2 (* v_~q_back~0_1150 4))) (and (not (= 0 (ite (and (<= 0 v_~q_back~0_1150) (< v_~q_back~0_1150 v_~n~0_548)) 1 0))) (= (+ 3 v_~q_back~0_1150) v_~q_back~0_1149) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_620| 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_1150))) (and (<= 0 .cse0) (< .cse0 v_~n~0_548))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568| 0)) (= v_~q_front~0_1010 (+ v_~q_front~0_1011 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_557)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_595| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|) (= (select .cse1 (+ (* v_~q_front~0_1011 4) v_~q~0.offset_557)) |v_thread2Thread1of1ForFork1_~j~0#1_620|) (= (+ v_~s~0_939 |v_thread2Thread1of1ForFork1_~j~0#1_620|) v_~s~0_938) (not (= 0 (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557)) 1) 1 0))) (< |v_thread1Thread1of1ForFork0_~i~0#1_595| (+ v_~N~0_424 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| (ite (and (< v_~q_front~0_1011 v_~q_back~0_1149) (<= 0 v_~q_front~0_1011) (< v_~q_front~0_1011 v_~n~0_548)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582| 0)))) InVars {~q_back~0=v_~q_back~0_1150, #memory_int=|v_#memory_int_817|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, ~n~0=v_~n~0_548, ~q~0.offset=v_~q~0.offset_557, ~s~0=v_~s~0_939, ~q_front~0=v_~q_front~0_1011} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_620|, ~q_back~0=v_~q_back~0_1149, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_568|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_403|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_568|, ~q~0.offset=v_~q~0.offset_557, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_407|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_403|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_595|, #memory_int=|v_#memory_int_817|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|, ~n~0=v_~n~0_548, ~s~0=v_~s~0_938, ~q_front~0=v_~q_front~0_1010} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:43:35,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_817| v_~q~0.base_557)) (.cse2 (* v_~q_back~0_1150 4))) (and (not (= 0 (ite (and (<= 0 v_~q_back~0_1150) (< v_~q_back~0_1150 v_~n~0_548)) 1 0))) (= (+ 3 v_~q_back~0_1150) v_~q_back~0_1149) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_620| 0)) (not (= (ite (let ((.cse0 (+ 2 v_~q_back~0_1150))) (and (<= 0 .cse0) (< .cse0 v_~n~0_548))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|) (not (= (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557 4)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568| 0)) (= v_~q_front~0_1010 (+ v_~q_front~0_1011 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| (ite (= (select .cse1 (+ .cse2 8 v_~q~0.offset_557)) 1) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_595| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|) (= (select .cse1 (+ (* v_~q_front~0_1011 4) v_~q~0.offset_557)) |v_thread2Thread1of1ForFork1_~j~0#1_620|) (= (+ v_~s~0_939 |v_thread2Thread1of1ForFork1_~j~0#1_620|) v_~s~0_938) (not (= 0 (ite (= (select .cse1 (+ .cse2 v_~q~0.offset_557)) 1) 1 0))) (< |v_thread1Thread1of1ForFork0_~i~0#1_595| (+ v_~N~0_424 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568| (ite (and (< v_~q_front~0_1011 v_~q_back~0_1149) (<= 0 v_~q_front~0_1011) (< v_~q_front~0_1011 v_~n~0_548)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582| 0)))) InVars {~q_back~0=v_~q_back~0_1150, #memory_int=|v_#memory_int_817|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, ~n~0=v_~n~0_548, ~q~0.offset=v_~q~0.offset_557, ~s~0=v_~s~0_939, ~q_front~0=v_~q_front~0_1011} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_620|, ~q_back~0=v_~q_back~0_1149, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_568|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_568|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_403|, ~N~0=v_~N~0_424, ~q~0.base=v_~q~0.base_557, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_568|, ~q~0.offset=v_~q~0.offset_557, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_568|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_582|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_407|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_403|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_595|, #memory_int=|v_#memory_int_817|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|, ~n~0=v_~n~0_548, ~s~0=v_~s~0_938, ~q_front~0=v_~q_front~0_1010} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:43:35,713 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:35,713 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:35,713 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:35,713 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:35,713 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:35,713 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,104 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,104 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,104 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,105 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,105 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,105 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:36,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:43:36,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1379 [2022-12-06 05:43:36,416 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 564 transitions, 16454 flow [2022-12-06 05:43:36,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:36,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:36,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:36,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:36,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-12-06 05:43:36,617 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash -557213854, now seen corresponding path program 2 times [2022-12-06 05:43:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:36,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176320554] [2022-12-06 05:43:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176320554] [2022-12-06 05:43:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176320554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552131272] [2022-12-06 05:43:37,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:43:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:37,717 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:37,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-06 05:43:38,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:43:38,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:43:38,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 05:43:38,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:38,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:38,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:43:38,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:38,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 05:43:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:38,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:38,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:38,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 232 treesize of output 265 [2022-12-06 05:43:38,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:38,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 115 [2022-12-06 05:43:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:38,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552131272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:38,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:38,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:43:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050601092] [2022-12-06 05:43:38,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:38,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:43:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:43:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:43:38,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 05:43:38,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 564 transitions, 16454 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:38,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:38,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 05:43:38,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:40,315 INFO L130 PetriNetUnfolder]: 1863/3446 cut-off events. [2022-12-06 05:43:40,316 INFO L131 PetriNetUnfolder]: For 139642/139720 co-relation queries the response was YES. [2022-12-06 05:43:40,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38092 conditions, 3446 events. 1863/3446 cut-off events. For 139642/139720 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 23308 event pairs, 296 based on Foata normal form. 71/3517 useless extension candidates. Maximal degree in co-relation 37145. Up to 3303 conditions per place. [2022-12-06 05:43:40,348 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 501 selfloop transitions, 67 changer transitions 13/582 dead transitions. [2022-12-06 05:43:40,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 582 transitions, 17732 flow [2022-12-06 05:43:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:43:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:43:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2022-12-06 05:43:40,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16779661016949152 [2022-12-06 05:43:40,349 INFO L175 Difference]: Start difference. First operand has 252 places, 564 transitions, 16454 flow. Second operand 10 states and 99 transitions. [2022-12-06 05:43:40,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 582 transitions, 17732 flow [2022-12-06 05:43:40,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 582 transitions, 17451 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-06 05:43:40,958 INFO L231 Difference]: Finished difference. Result has 258 places, 560 transitions, 16223 flow [2022-12-06 05:43:40,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=16168, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16223, PETRI_PLACES=258, PETRI_TRANSITIONS=560} [2022-12-06 05:43:40,959 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 237 predicate places. [2022-12-06 05:43:40,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:40,959 INFO L89 Accepts]: Start accepts. Operand has 258 places, 560 transitions, 16223 flow [2022-12-06 05:43:40,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:40,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:40,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 560 transitions, 16223 flow [2022-12-06 05:43:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 560 transitions, 16223 flow [2022-12-06 05:43:41,202 INFO L130 PetriNetUnfolder]: 492/1462 cut-off events. [2022-12-06 05:43:41,203 INFO L131 PetriNetUnfolder]: For 60543/61151 co-relation queries the response was YES. [2022-12-06 05:43:41,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14243 conditions, 1462 events. 492/1462 cut-off events. For 60543/61151 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12332 event pairs, 8 based on Foata normal form. 189/1647 useless extension candidates. Maximal degree in co-relation 14006. Up to 430 conditions per place. [2022-12-06 05:43:41,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 560 transitions, 16223 flow [2022-12-06 05:43:41,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 1830 [2022-12-06 05:43:41,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] L65-2-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_874| v_~q~0.base_597)) (.cse4 (* v_~q_front~0_1109 4))) (let ((.cse2 (select .cse1 (+ .cse4 v_~q~0.offset_597 4))) (.cse3 (select .cse1 (+ .cse4 v_~q~0.offset_597)))) (and (not (= (ite (let ((.cse0 (+ v_~q_front~0_1109 1))) (and (<= 0 .cse0) (< .cse0 v_~q_back~0_1264) (< .cse0 v_~n~0_588))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_689| 0)) (= (+ v_~q_front~0_1109 3) v_~q_front~0_1107) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_659| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659|) (= (select .cse1 (+ (* v_~q_front~0_1107 4) (- 4) v_~q~0.offset_597)) |v_thread2Thread1of1ForFork1_~j~0#1_689|) (< |v_thread1Thread1of1ForFork0_~i~0#1_662| v_~N~0_462) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1264 4) v_~q~0.offset_597)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_659|) (not (= .cse2 0)) (= (+ .cse2 .cse3 v_~s~0_1037 |v_thread2Thread1of1ForFork1_~j~0#1_689|) v_~s~0_1035) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_631| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_631|) (not (= .cse3 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659| 0)) (= (+ v_~q_back~0_1264 1) v_~q_back~0_1263) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_631| (ite (and (< v_~q_front~0_1107 (+ v_~n~0_588 1)) (< v_~q_front~0_1107 (+ v_~q_back~0_1263 1)) (<= 1 v_~q_front~0_1107)) 1 0)) (not (= (ite (and (< v_~q_back~0_1264 v_~n~0_588) (<= 0 v_~q_back~0_1264)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_1109) (< v_~q_front~0_1109 v_~q_back~0_1264) (< v_~q_front~0_1109 v_~n~0_588)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_661| (+ |v_thread1Thread1of1ForFork0_~i~0#1_662| 1))))) InVars {~q_back~0=v_~q_back~0_1264, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_662|, #memory_int=|v_#memory_int_874|, ~N~0=v_~N~0_462, ~q~0.base=v_~q~0.base_597, ~n~0=v_~n~0_588, ~q~0.offset=v_~q~0.offset_597, ~s~0=v_~s~0_1037, ~q_front~0=v_~q_front~0_1109} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_689|, ~q_back~0=v_~q_back~0_1263, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_631|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_631|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_466|, ~N~0=v_~N~0_462, ~q~0.base=v_~q~0.base_597, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_631|, ~q~0.offset=v_~q~0.offset_597, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_631|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_659|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_470|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_466|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_661|, #memory_int=|v_#memory_int_874|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659|, ~n~0=v_~n~0_588, ~s~0=v_~s~0_1035, ~q_front~0=v_~q_front~0_1107} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:43:41,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:43:41,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 618 [2022-12-06 05:43:41,577 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 559 transitions, 16215 flow [2022-12-06 05:43:41,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:41,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:41,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:41,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-12-06 05:43:41,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-12-06 05:43:41,777 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash 469306193, now seen corresponding path program 1 times [2022-12-06 05:43:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:41,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672968357] [2022-12-06 05:43:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672968357] [2022-12-06 05:43:42,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672968357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500484278] [2022-12-06 05:43:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:42,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:42,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:42,145 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:42,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-06 05:43:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:42,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:43:42,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:42,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:42,460 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:43:42,460 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 26 treesize of output 18 [2022-12-06 05:43:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:42,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500484278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:42,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:42,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 05:43:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662701075] [2022-12-06 05:43:42,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:42,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:43:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:43:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:43:42,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 57 [2022-12-06 05:43:42,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 559 transitions, 16215 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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 05:43:42,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:42,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 57 [2022-12-06 05:43:42,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:43,918 INFO L130 PetriNetUnfolder]: 1962/3611 cut-off events. [2022-12-06 05:43:43,918 INFO L131 PetriNetUnfolder]: For 162142/162318 co-relation queries the response was YES. [2022-12-06 05:43:43,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39804 conditions, 3611 events. 1962/3611 cut-off events. For 162142/162318 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 24858 event pairs, 357 based on Foata normal form. 122/3733 useless extension candidates. Maximal degree in co-relation 39134. Up to 2479 conditions per place. [2022-12-06 05:43:43,954 INFO L137 encePairwiseOnDemand]: 15/57 looper letters, 407 selfloop transitions, 242 changer transitions 0/650 dead transitions. [2022-12-06 05:43:43,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 650 transitions, 19252 flow [2022-12-06 05:43:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:43:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:43:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2022-12-06 05:43:43,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17690058479532164 [2022-12-06 05:43:43,955 INFO L175 Difference]: Start difference. First operand has 252 places, 559 transitions, 16215 flow. Second operand 12 states and 121 transitions. [2022-12-06 05:43:43,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 650 transitions, 19252 flow [2022-12-06 05:43:44,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 650 transitions, 19094 flow, removed 11 selfloop flow, removed 10 redundant places. [2022-12-06 05:43:44,583 INFO L231 Difference]: Finished difference. Result has 255 places, 583 transitions, 17588 flow [2022-12-06 05:43:44,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=16065, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17588, PETRI_PLACES=255, PETRI_TRANSITIONS=583} [2022-12-06 05:43:44,584 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2022-12-06 05:43:44,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:44,584 INFO L89 Accepts]: Start accepts. Operand has 255 places, 583 transitions, 17588 flow [2022-12-06 05:43:44,587 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:44,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:44,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 583 transitions, 17588 flow [2022-12-06 05:43:44,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 583 transitions, 17588 flow [2022-12-06 05:43:44,844 INFO L130 PetriNetUnfolder]: 520/1533 cut-off events. [2022-12-06 05:43:44,844 INFO L131 PetriNetUnfolder]: For 66618/67260 co-relation queries the response was YES. [2022-12-06 05:43:44,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15389 conditions, 1533 events. 520/1533 cut-off events. For 66618/67260 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 13129 event pairs, 7 based on Foata normal form. 195/1723 useless extension candidates. Maximal degree in co-relation 14984. Up to 465 conditions per place. [2022-12-06 05:43:44,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 583 transitions, 17588 flow [2022-12-06 05:43:44,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 1936 [2022-12-06 05:43:44,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~q~0.base_523))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520| 0)) (= v_~q_back~0_1054 (+ 2 v_~q_back~0_1055)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_1055 4) v_~q~0.offset_523)) 1) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_234| |v_#pthreadsForks_304|) (= |v_thread1Thread1of1ForFork0_~i~0#1_542| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|) (= (store |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157| (store (select |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157|) |v_ULTIMATE.start_main_~#t2~0#1.offset_154| |v_ULTIMATE.start_main_#t~pre14#1_234|)) |v_#memory_int_771|) (not (= (ite (and (< v_~q_back~0_1054 (+ v_~n~0_514 1)) (<= 1 v_~q_back~0_1054)) 1 0) 0)) (= (+ |v_#pthreadsForks_304| 1) |v_#pthreadsForks_303|) (< |v_thread1Thread1of1ForFork0_~i~0#1_542| (+ v_~N~0_392 1)) (not (= (ite (and (<= 0 v_~q_back~0_1055) (< v_~q_back~0_1055 v_~n~0_514)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_523 (* v_~q_back~0_1054 4))) 1) 1 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_304|, ~q_back~0=v_~q_back~0_1055, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~n~0=v_~n~0_514, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} OutVars{~q_back~0=v_~q_back~0_1054, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_357|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_234|, #pthreadsForks=|v_#pthreadsForks_303|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_361|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_357|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_542|, #memory_int=|v_#memory_int_771|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_187|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|, ~n~0=v_~n~0_514, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:43:44,864 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:44,864 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:44,864 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:44,864 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:43:45,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~q~0.base_523))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520| 0)) (= v_~q_back~0_1054 (+ 2 v_~q_back~0_1055)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_1055 4) v_~q~0.offset_523)) 1) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre14#1_234| |v_#pthreadsForks_304|) (= |v_thread1Thread1of1ForFork0_~i~0#1_542| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|) (= (store |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157| (store (select |v_#memory_int_772| |v_ULTIMATE.start_main_~#t2~0#1.base_157|) |v_ULTIMATE.start_main_~#t2~0#1.offset_154| |v_ULTIMATE.start_main_#t~pre14#1_234|)) |v_#memory_int_771|) (not (= (ite (and (< v_~q_back~0_1054 (+ v_~n~0_514 1)) (<= 1 v_~q_back~0_1054)) 1 0) 0)) (= (+ |v_#pthreadsForks_304| 1) |v_#pthreadsForks_303|) (< |v_thread1Thread1of1ForFork0_~i~0#1_542| (+ v_~N~0_392 1)) (not (= (ite (and (<= 0 v_~q_back~0_1055) (< v_~q_back~0_1055 v_~n~0_514)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| (ite (= (select .cse0 (+ (- 4) v_~q~0.offset_523 (* v_~q_back~0_1054 4))) 1) 1 0)))) InVars {#pthreadsForks=|v_#pthreadsForks_304|, ~q_back~0=v_~q_back~0_1055, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~n~0=v_~n~0_514, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} OutVars{~q_back~0=v_~q_back~0_1054, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_154|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_357|, ~N~0=v_~N~0_392, ~q~0.base=v_~q~0.base_523, ~q~0.offset=v_~q~0.offset_523, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_228|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_234|, #pthreadsForks=|v_#pthreadsForks_303|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_361|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_357|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_542|, #memory_int=|v_#memory_int_771|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_187|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|, ~n~0=v_~n~0_514, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_157|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:43:45,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:43:45,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 817 [2022-12-06 05:43:45,402 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 583 transitions, 17626 flow [2022-12-06 05:43:45,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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 05:43:45,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:45,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:45,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:45,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-12-06 05:43:45,602 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 113522345, now seen corresponding path program 1 times [2022-12-06 05:43:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863160397] [2022-12-06 05:43:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863160397] [2022-12-06 05:43:46,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863160397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109638694] [2022-12-06 05:43:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:46,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:46,415 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:46,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-06 05:43:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:46,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 05:43:46,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:46,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:46,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:43:46,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:46,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 20 [2022-12-06 05:43:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:46,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:47,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:47,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 271 treesize of output 382 [2022-12-06 05:43:47,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:47,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 05:43:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:48,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109638694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:48,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:48,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:43:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677710001] [2022-12-06 05:43:48,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:48,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:43:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:48,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:43:48,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:43:48,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 05:43:48,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 583 transitions, 17626 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:48,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:48,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 05:43:48,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:50,475 INFO L130 PetriNetUnfolder]: 1969/3645 cut-off events. [2022-12-06 05:43:50,475 INFO L131 PetriNetUnfolder]: For 161191/161222 co-relation queries the response was YES. [2022-12-06 05:43:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41178 conditions, 3645 events. 1969/3645 cut-off events. For 161191/161222 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 25085 event pairs, 566 based on Foata normal form. 15/3660 useless extension candidates. Maximal degree in co-relation 40092. Up to 3448 conditions per place. [2022-12-06 05:43:50,516 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 524 selfloop transitions, 80 changer transitions 7/612 dead transitions. [2022-12-06 05:43:50,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 612 transitions, 19144 flow [2022-12-06 05:43:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:43:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:43:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-06 05:43:50,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15819209039548024 [2022-12-06 05:43:50,517 INFO L175 Difference]: Start difference. First operand has 255 places, 583 transitions, 17626 flow. Second operand 12 states and 112 transitions. [2022-12-06 05:43:50,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 612 transitions, 19144 flow [2022-12-06 05:43:51,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 612 transitions, 18829 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-06 05:43:51,286 INFO L231 Difference]: Finished difference. Result has 261 places, 586 transitions, 17569 flow [2022-12-06 05:43:51,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17317, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17569, PETRI_PLACES=261, PETRI_TRANSITIONS=586} [2022-12-06 05:43:51,287 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-06 05:43:51,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:51,287 INFO L89 Accepts]: Start accepts. Operand has 261 places, 586 transitions, 17569 flow [2022-12-06 05:43:51,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:51,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:51,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 586 transitions, 17569 flow [2022-12-06 05:43:51,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 586 transitions, 17569 flow [2022-12-06 05:43:51,572 INFO L130 PetriNetUnfolder]: 520/1546 cut-off events. [2022-12-06 05:43:51,573 INFO L131 PetriNetUnfolder]: For 66651/67313 co-relation queries the response was YES. [2022-12-06 05:43:51,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15419 conditions, 1546 events. 520/1546 cut-off events. For 66651/67313 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 13276 event pairs, 8 based on Foata normal form. 204/1745 useless extension candidates. Maximal degree in co-relation 15188. Up to 467 conditions per place. [2022-12-06 05:43:51,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 586 transitions, 17569 flow [2022-12-06 05:43:51,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 1928 [2022-12-06 05:43:51,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:51,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-06 05:43:51,600 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 586 transitions, 17569 flow [2022-12-06 05:43:51,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:51,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:51,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:51,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:51,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-12-06 05:43:51,807 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1584668543, now seen corresponding path program 2 times [2022-12-06 05:43:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:51,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221996149] [2022-12-06 05:43:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:52,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221996149] [2022-12-06 05:43:52,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221996149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:52,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720451785] [2022-12-06 05:43:52,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:43:52,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:52,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:52,750 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:52,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-06 05:43:53,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:43:53,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:43:53,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:43:53,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:53,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:43:53,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:53,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 20 [2022-12-06 05:43:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:53,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:53,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:53,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 271 treesize of output 382 [2022-12-06 05:43:53,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:53,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 05:43:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:55,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720451785] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:55,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:55,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:43:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721502319] [2022-12-06 05:43:55,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:55,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:43:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:43:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:43:55,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 05:43:55,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 586 transitions, 17569 flow. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:55,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:55,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 05:43:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:57,387 INFO L130 PetriNetUnfolder]: 1961/3623 cut-off events. [2022-12-06 05:43:57,388 INFO L131 PetriNetUnfolder]: For 154143/154213 co-relation queries the response was YES. [2022-12-06 05:43:57,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40669 conditions, 3623 events. 1961/3623 cut-off events. For 154143/154213 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 24841 event pairs, 345 based on Foata normal form. 67/3690 useless extension candidates. Maximal degree in co-relation 40404. Up to 3473 conditions per place. [2022-12-06 05:43:57,489 INFO L137 encePairwiseOnDemand]: 21/59 looper letters, 524 selfloop transitions, 69 changer transitions 10/604 dead transitions. [2022-12-06 05:43:57,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 604 transitions, 18891 flow [2022-12-06 05:43:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:43:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:43:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2022-12-06 05:43:57,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1711864406779661 [2022-12-06 05:43:57,490 INFO L175 Difference]: Start difference. First operand has 260 places, 586 transitions, 17569 flow. Second operand 10 states and 101 transitions. [2022-12-06 05:43:57,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 604 transitions, 18891 flow [2022-12-06 05:43:58,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 604 transitions, 18727 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-06 05:43:58,221 INFO L231 Difference]: Finished difference. Result has 262 places, 584 transitions, 17525 flow [2022-12-06 05:43:58,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17398, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17525, PETRI_PLACES=262, PETRI_TRANSITIONS=584} [2022-12-06 05:43:58,222 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 241 predicate places. [2022-12-06 05:43:58,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:58,222 INFO L89 Accepts]: Start accepts. Operand has 262 places, 584 transitions, 17525 flow [2022-12-06 05:43:58,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:58,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:58,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 584 transitions, 17525 flow [2022-12-06 05:43:58,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 584 transitions, 17525 flow [2022-12-06 05:43:58,517 INFO L130 PetriNetUnfolder]: 519/1536 cut-off events. [2022-12-06 05:43:58,517 INFO L131 PetriNetUnfolder]: For 66206/66895 co-relation queries the response was YES. [2022-12-06 05:43:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15299 conditions, 1536 events. 519/1536 cut-off events. For 66206/66895 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13151 event pairs, 7 based on Foata normal form. 201/1732 useless extension candidates. Maximal degree in co-relation 14805. Up to 463 conditions per place. [2022-12-06 05:43:58,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 584 transitions, 17525 flow [2022-12-06 05:43:58,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-06 05:43:58,544 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:58,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 323 [2022-12-06 05:43:58,545 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 584 transitions, 17525 flow [2022-12-06 05:43:58,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:58,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:58,545 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:58,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-12-06 05:43:58,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:58,753 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:43:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2133807661, now seen corresponding path program 1 times [2022-12-06 05:43:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:58,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980868400] [2022-12-06 05:43:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980868400] [2022-12-06 05:43:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980868400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644299404] [2022-12-06 05:43:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:59,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:59,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:59,206 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:43:59,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-06 05:43:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:59,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:43:59,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:59,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:43:59,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:43:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:59,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:43:59,621 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4356 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4356) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 8)) 0))) is different from false [2022-12-06 05:43:59,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:43:59,628 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 42 [2022-12-06 05:43:59,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:43:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:59,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644299404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:43:59,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:43:59,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:43:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690087622] [2022-12-06 05:43:59,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:43:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:43:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:43:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-12-06 05:43:59,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 05:43:59,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 584 transitions, 17525 flow. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:59,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:59,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 05:43:59,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:01,183 INFO L130 PetriNetUnfolder]: 2064/3797 cut-off events. [2022-12-06 05:44:01,183 INFO L131 PetriNetUnfolder]: For 171383/171457 co-relation queries the response was YES. [2022-12-06 05:44:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42834 conditions, 3797 events. 2064/3797 cut-off events. For 171383/171457 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25993 event pairs, 250 based on Foata normal form. 105/3902 useless extension candidates. Maximal degree in co-relation 41745. Up to 2530 conditions per place. [2022-12-06 05:44:01,236 INFO L137 encePairwiseOnDemand]: 23/59 looper letters, 442 selfloop transitions, 221 changer transitions 0/664 dead transitions. [2022-12-06 05:44:01,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 664 transitions, 20501 flow [2022-12-06 05:44:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:44:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:44:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-06 05:44:01,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19962335216572505 [2022-12-06 05:44:01,237 INFO L175 Difference]: Start difference. First operand has 260 places, 584 transitions, 17525 flow. Second operand 9 states and 106 transitions. [2022-12-06 05:44:01,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 664 transitions, 20501 flow [2022-12-06 05:44:02,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 664 transitions, 20310 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-06 05:44:02,093 INFO L231 Difference]: Finished difference. Result has 261 places, 608 transitions, 18779 flow [2022-12-06 05:44:02,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17334, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18779, PETRI_PLACES=261, PETRI_TRANSITIONS=608} [2022-12-06 05:44:02,094 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-06 05:44:02,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:02,094 INFO L89 Accepts]: Start accepts. Operand has 261 places, 608 transitions, 18779 flow [2022-12-06 05:44:02,100 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:02,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:02,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 608 transitions, 18779 flow [2022-12-06 05:44:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 608 transitions, 18779 flow [2022-12-06 05:44:02,417 INFO L130 PetriNetUnfolder]: 545/1611 cut-off events. [2022-12-06 05:44:02,417 INFO L131 PetriNetUnfolder]: For 72286/72890 co-relation queries the response was YES. [2022-12-06 05:44:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16358 conditions, 1611 events. 545/1611 cut-off events. For 72286/72890 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 13884 event pairs, 8 based on Foata normal form. 198/1804 useless extension candidates. Maximal degree in co-relation 15863. Up to 499 conditions per place. [2022-12-06 05:44:02,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 608 transitions, 18779 flow [2022-12-06 05:44:02,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 2030 [2022-12-06 05:44:02,444 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:02,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 05:44:02,444 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 608 transitions, 18779 flow [2022-12-06 05:44:02,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:02,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:02,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:02,650 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1586533847, now seen corresponding path program 1 times [2022-12-06 05:44:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:02,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028350765] [2022-12-06 05:44:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:03,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:03,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028350765] [2022-12-06 05:44:03,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028350765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:03,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581981710] [2022-12-06 05:44:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:03,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:03,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:03,047 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:03,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-06 05:44:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:03,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 05:44:03,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:03,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:03,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:44:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:03,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:03,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:03,449 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 47 treesize of output 44 [2022-12-06 05:44:03,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:44:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:03,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581981710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:03,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:03,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:44:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275223483] [2022-12-06 05:44:03,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:03,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:44:03,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:44:03,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=260, Unknown=1, NotChecked=0, Total=306 [2022-12-06 05:44:03,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2022-12-06 05:44:03,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 608 transitions, 18779 flow. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:03,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:03,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2022-12-06 05:44:03,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:05,406 INFO L130 PetriNetUnfolder]: 2436/4439 cut-off events. [2022-12-06 05:44:05,407 INFO L131 PetriNetUnfolder]: For 217140/217236 co-relation queries the response was YES. [2022-12-06 05:44:05,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50739 conditions, 4439 events. 2436/4439 cut-off events. For 217140/217236 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 31210 event pairs, 242 based on Foata normal form. 173/4612 useless extension candidates. Maximal degree in co-relation 49224. Up to 2263 conditions per place. [2022-12-06 05:44:05,454 INFO L137 encePairwiseOnDemand]: 26/59 looper letters, 417 selfloop transitions, 387 changer transitions 0/805 dead transitions. [2022-12-06 05:44:05,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 805 transitions, 24562 flow [2022-12-06 05:44:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:44:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:44:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-12-06 05:44:05,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.196870925684485 [2022-12-06 05:44:05,455 INFO L175 Difference]: Start difference. First operand has 261 places, 608 transitions, 18779 flow. Second operand 13 states and 151 transitions. [2022-12-06 05:44:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 805 transitions, 24562 flow [2022-12-06 05:44:06,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 805 transitions, 23497 flow, removed 424 selfloop flow, removed 6 redundant places. [2022-12-06 05:44:06,434 INFO L231 Difference]: Finished difference. Result has 276 places, 705 transitions, 21968 flow [2022-12-06 05:44:06,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=17633, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=21968, PETRI_PLACES=276, PETRI_TRANSITIONS=705} [2022-12-06 05:44:06,435 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-06 05:44:06,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:06,435 INFO L89 Accepts]: Start accepts. Operand has 276 places, 705 transitions, 21968 flow [2022-12-06 05:44:06,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:06,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:06,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 705 transitions, 21968 flow [2022-12-06 05:44:06,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 705 transitions, 21968 flow [2022-12-06 05:44:06,845 INFO L130 PetriNetUnfolder]: 642/1865 cut-off events. [2022-12-06 05:44:06,845 INFO L131 PetriNetUnfolder]: For 85223/85902 co-relation queries the response was YES. [2022-12-06 05:44:06,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19245 conditions, 1865 events. 642/1865 cut-off events. For 85223/85902 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 16544 event pairs, 9 based on Foata normal form. 210/2070 useless extension candidates. Maximal degree in co-relation 18884. Up to 599 conditions per place. [2022-12-06 05:44:06,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 705 transitions, 21968 flow [2022-12-06 05:44:06,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 2400 [2022-12-06 05:44:06,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:44:07,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [543] L65-2-->thread2EXIT: Formula: (and (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_4|)) (= (+ v_~s~0_In_4 |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|) v_~s~0_Out_16) (= |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_~q_back~0_In_6) (< v_~q_front~0_In_4 v_~n~0_In_8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (+ v_~q_front~0_In_4 1) v_~q_front~0_Out_20) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (select (select |v_#memory_int_In_17| v_~q~0.base_In_6) (+ v_~q~0.offset_In_6 (* v_~q_front~0_In_4 4))) |v_thread2Thread1of1ForFork1_~j~0#1_Out_4|)) InVars {~q_back~0=v_~q_back~0_In_6, ~q~0.base=v_~q~0.base_In_6, ~q~0.offset=v_~q~0.offset_In_6, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_In_4, ~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, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|, 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_4|, #memory_int=|v_#memory_int_In_17|, ~n~0=v_~n~0_In_8, ~s~0=v_~s~0_Out_16, ~q_front~0=v_~q_front~0_Out_20} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:44:07,372 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:07,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 938 [2022-12-06 05:44:07,373 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 704 transitions, 21941 flow [2022-12-06 05:44:07,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:07,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:07,373 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:07,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:07,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:07,584 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -296087447, now seen corresponding path program 1 times [2022-12-06 05:44:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390211607] [2022-12-06 05:44:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:08,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390211607] [2022-12-06 05:44:08,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390211607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032901227] [2022-12-06 05:44:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:08,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:08,423 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:08,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-06 05:44:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:08,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 05:44:08,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:08,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:08,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:44:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:44:08,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:08,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:08,847 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 42 [2022-12-06 05:44:08,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-06 05:44:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:44:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032901227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:08,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:08,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 16 [2022-12-06 05:44:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891361182] [2022-12-06 05:44:08,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:08,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:44:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:44:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:44:08,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2022-12-06 05:44:08,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 704 transitions, 21941 flow. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:08,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:08,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2022-12-06 05:44:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:11,465 INFO L130 PetriNetUnfolder]: 2781/5059 cut-off events. [2022-12-06 05:44:11,465 INFO L131 PetriNetUnfolder]: For 256861/256885 co-relation queries the response was YES. [2022-12-06 05:44:11,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58579 conditions, 5059 events. 2781/5059 cut-off events. For 256861/256885 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 36270 event pairs, 351 based on Foata normal form. 74/5133 useless extension candidates. Maximal degree in co-relation 57611. Up to 3398 conditions per place. [2022-12-06 05:44:11,517 INFO L137 encePairwiseOnDemand]: 14/61 looper letters, 537 selfloop transitions, 339 changer transitions 0/877 dead transitions. [2022-12-06 05:44:11,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 877 transitions, 27767 flow [2022-12-06 05:44:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:44:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:44:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2022-12-06 05:44:11,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20081967213114754 [2022-12-06 05:44:11,519 INFO L175 Difference]: Start difference. First operand has 275 places, 704 transitions, 21941 flow. Second operand 12 states and 147 transitions. [2022-12-06 05:44:11,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 877 transitions, 27767 flow [2022-12-06 05:44:12,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 877 transitions, 26979 flow, removed 394 selfloop flow, removed 0 redundant places. [2022-12-06 05:44:12,825 INFO L231 Difference]: Finished difference. Result has 289 places, 792 transitions, 25025 flow [2022-12-06 05:44:12,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=21167, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=25025, PETRI_PLACES=289, PETRI_TRANSITIONS=792} [2022-12-06 05:44:12,825 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 268 predicate places. [2022-12-06 05:44:12,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,825 INFO L89 Accepts]: Start accepts. Operand has 289 places, 792 transitions, 25025 flow [2022-12-06 05:44:12,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 792 transitions, 25025 flow [2022-12-06 05:44:12,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 792 transitions, 25025 flow [2022-12-06 05:44:13,325 INFO L130 PetriNetUnfolder]: 735/2120 cut-off events. [2022-12-06 05:44:13,325 INFO L131 PetriNetUnfolder]: For 102886/103740 co-relation queries the response was YES. [2022-12-06 05:44:13,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22010 conditions, 2120 events. 735/2120 cut-off events. For 102886/103740 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 19179 event pairs, 6 based on Foata normal form. 268/2382 useless extension candidates. Maximal degree in co-relation 21668. Up to 696 conditions per place. [2022-12-06 05:44:13,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 792 transitions, 25025 flow [2022-12-06 05:44:13,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 2710 [2022-12-06 05:44:13,596 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:13,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 771 [2022-12-06 05:44:13,596 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 791 transitions, 25021 flow [2022-12-06 05:44:13,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:13,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:13,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-12-06 05:44:13,813 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash -858553338, now seen corresponding path program 1 times [2022-12-06 05:44:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:13,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87939224] [2022-12-06 05:44:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87939224] [2022-12-06 05:44:14,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87939224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866892567] [2022-12-06 05:44:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:14,436 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:14,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-06 05:44:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:14,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:44:14,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:14,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:14,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:44:14,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:14,809 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 46 treesize of output 12 [2022-12-06 05:44:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:14,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:15,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:15,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 178 [2022-12-06 05:44:15,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:15,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 128 [2022-12-06 05:44:15,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:15,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 108 [2022-12-06 05:44:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:15,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866892567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:15,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:15,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:44:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850174114] [2022-12-06 05:44:15,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:44:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:44:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=283, Unknown=8, NotChecked=0, Total=342 [2022-12-06 05:44:15,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-06 05:44:15,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 791 transitions, 25021 flow. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:15,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:15,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-06 05:44:15,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:22,001 INFO L130 PetriNetUnfolder]: 2786/5073 cut-off events. [2022-12-06 05:44:22,001 INFO L131 PetriNetUnfolder]: For 247272/247382 co-relation queries the response was YES. [2022-12-06 05:44:22,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59117 conditions, 5073 events. 2786/5073 cut-off events. For 247272/247382 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 36963 event pairs, 829 based on Foata normal form. 20/5093 useless extension candidates. Maximal degree in co-relation 58255. Up to 4877 conditions per place. [2022-12-06 05:44:22,065 INFO L137 encePairwiseOnDemand]: 25/63 looper letters, 734 selfloop transitions, 77 changer transitions 6/818 dead transitions. [2022-12-06 05:44:22,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 818 transitions, 26817 flow [2022-12-06 05:44:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:44:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:44:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-12-06 05:44:22,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15211640211640212 [2022-12-06 05:44:22,067 INFO L175 Difference]: Start difference. First operand has 288 places, 791 transitions, 25021 flow. Second operand 12 states and 115 transitions. [2022-12-06 05:44:22,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 818 transitions, 26817 flow [2022-12-06 05:44:23,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 818 transitions, 26480 flow, removed 161 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:23,718 INFO L231 Difference]: Finished difference. Result has 299 places, 791 transitions, 24848 flow [2022-12-06 05:44:23,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=24684, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=24848, PETRI_PLACES=299, PETRI_TRANSITIONS=791} [2022-12-06 05:44:23,719 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 278 predicate places. [2022-12-06 05:44:23,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:23,719 INFO L89 Accepts]: Start accepts. Operand has 299 places, 791 transitions, 24848 flow [2022-12-06 05:44:23,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:23,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:23,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 791 transitions, 24848 flow [2022-12-06 05:44:23,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 791 transitions, 24848 flow [2022-12-06 05:44:24,248 INFO L130 PetriNetUnfolder]: 734/2126 cut-off events. [2022-12-06 05:44:24,248 INFO L131 PetriNetUnfolder]: For 100753/101471 co-relation queries the response was YES. [2022-12-06 05:44:24,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22022 conditions, 2126 events. 734/2126 cut-off events. For 100753/101471 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 19463 event pairs, 9 based on Foata normal form. 238/2358 useless extension candidates. Maximal degree in co-relation 21772. Up to 698 conditions per place. [2022-12-06 05:44:24,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 791 transitions, 24848 flow [2022-12-06 05:44:24,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 2708 [2022-12-06 05:44:24,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:44:24,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:24,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 724 [2022-12-06 05:44:24,443 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 790 transitions, 24826 flow [2022-12-06 05:44:24,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:24,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:24,443 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:24,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:24,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:24,644 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash -81917533, now seen corresponding path program 1 times [2022-12-06 05:44:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327463913] [2022-12-06 05:44:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:25,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:25,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327463913] [2022-12-06 05:44:25,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327463913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:25,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747610800] [2022-12-06 05:44:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:25,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:25,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:25,087 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:25,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-06 05:44:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:25,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:44:25,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:25,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:25,460 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:44:25,460 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 26 treesize of output 18 [2022-12-06 05:44:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:25,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747610800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:25,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:25,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 05:44:25,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940545796] [2022-12-06 05:44:25,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:25,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:44:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:44:25,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:44:25,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-06 05:44:25,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 790 transitions, 24826 flow. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:25,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:25,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-06 05:44:25,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:30,128 INFO L130 PetriNetUnfolder]: 3717/6794 cut-off events. [2022-12-06 05:44:30,128 INFO L131 PetriNetUnfolder]: For 385959/386035 co-relation queries the response was YES. [2022-12-06 05:44:30,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79399 conditions, 6794 events. 3717/6794 cut-off events. For 385959/386035 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 51059 event pairs, 153 based on Foata normal form. 252/7046 useless extension candidates. Maximal degree in co-relation 79014. Up to 2463 conditions per place. [2022-12-06 05:44:30,230 INFO L137 encePairwiseOnDemand]: 15/63 looper letters, 344 selfloop transitions, 886 changer transitions 3/1234 dead transitions. [2022-12-06 05:44:30,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 1234 transitions, 37837 flow [2022-12-06 05:44:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 05:44:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 05:44:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 299 transitions. [2022-12-06 05:44:30,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14381914381914382 [2022-12-06 05:44:30,232 INFO L175 Difference]: Start difference. First operand has 297 places, 790 transitions, 24826 flow. Second operand 33 states and 299 transitions. [2022-12-06 05:44:30,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 1234 transitions, 37837 flow [2022-12-06 05:44:32,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1234 transitions, 37674 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-12-06 05:44:32,089 INFO L231 Difference]: Finished difference. Result has 341 places, 1079 transitions, 36998 flow [2022-12-06 05:44:32,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=24332, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=632, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=36998, PETRI_PLACES=341, PETRI_TRANSITIONS=1079} [2022-12-06 05:44:32,090 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 320 predicate places. [2022-12-06 05:44:32,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:32,090 INFO L89 Accepts]: Start accepts. Operand has 341 places, 1079 transitions, 36998 flow [2022-12-06 05:44:32,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:32,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:32,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 341 places, 1079 transitions, 36998 flow [2022-12-06 05:44:32,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 1079 transitions, 36998 flow [2022-12-06 05:44:32,953 INFO L130 PetriNetUnfolder]: 972/2839 cut-off events. [2022-12-06 05:44:32,953 INFO L131 PetriNetUnfolder]: For 173576/174668 co-relation queries the response was YES. [2022-12-06 05:44:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33816 conditions, 2839 events. 972/2839 cut-off events. For 173576/174668 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 27222 event pairs, 11 based on Foata normal form. 251/3085 useless extension candidates. Maximal degree in co-relation 33381. Up to 969 conditions per place. [2022-12-06 05:44:33,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 341 places, 1079 transitions, 36998 flow [2022-12-06 05:44:33,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 3682 [2022-12-06 05:44:33,025 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,026 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:44:33,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_933| v_~q~0.base_622))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_726| (+ |v_thread1Thread1of1ForFork0_~i~0#1_727| 1)) (= (select .cse0 (+ (* v_~q_front~0_1198 4) v_~q~0.offset_622)) |v_thread2Thread1of1ForFork1_~j~0#1_766|) (< |v_thread1Thread1of1ForFork0_~i~0#1_727| v_~N~0_484) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_766| 0)) (= v_~s~0_1124 (+ v_~s~0_1125 |v_thread2Thread1of1ForFork1_~j~0#1_766|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_729| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_729|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_729| 0)) (= (+ v_~q_front~0_1198 1) v_~q_front~0_1197) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_697| 0)) (= v_~q_back~0_1357 (+ v_~q_back~0_1358 1)) (not (= (ite (and (<= 0 v_~q_back~0_1358) (< v_~q_back~0_1358 v_~n~0_610)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_697| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_697|) (= (ite (and (<= 0 v_~q_front~0_1198) (< v_~q_front~0_1198 v_~q_back~0_1358) (< v_~q_front~0_1198 v_~n~0_610)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_697|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_729| (ite (= (select .cse0 (+ (* v_~q_back~0_1358 4) v_~q~0.offset_622)) 1) 1 0)))) InVars {~q_back~0=v_~q_back~0_1358, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_727|, #memory_int=|v_#memory_int_933|, ~N~0=v_~N~0_484, ~q~0.base=v_~q~0.base_622, ~n~0=v_~n~0_610, ~q~0.offset=v_~q~0.offset_622, ~s~0=v_~s~0_1125, ~q_front~0=v_~q_front~0_1198} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_766|, ~q_back~0=v_~q_back~0_1357, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_697|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_517|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_697|, ~N~0=v_~N~0_484, ~q~0.base=v_~q~0.base_622, ~q~0.offset=v_~q~0.offset_622, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_697|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_697|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_729|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_521|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_517|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_726|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_729|, #memory_int=|v_#memory_int_933|, ~n~0=v_~n~0_610, ~s~0=v_~s~0_1124, ~q_front~0=v_~q_front~0_1197} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:44:33,264 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,264 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,264 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,265 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,265 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,265 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,937 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,937 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,937 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,937 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,937 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:33,937 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:34,162 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:34,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2072 [2022-12-06 05:44:34,162 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 1079 transitions, 37138 flow [2022-12-06 05:44:34,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:34,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:34,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:34,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:34,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-12-06 05:44:34,369 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash -593852087, now seen corresponding path program 1 times [2022-12-06 05:44:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:34,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776654740] [2022-12-06 05:44:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:35,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776654740] [2022-12-06 05:44:35,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776654740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:35,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179881017] [2022-12-06 05:44:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:35,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:35,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:35,031 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:35,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-06 05:44:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:35,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:44:35,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:35,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:35,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 05:44:35,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:35,394 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 46 treesize of output 12 [2022-12-06 05:44:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:35,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:35,519 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q_front~0 4))) (let ((.cse3 (+ c_~q~0.offset (* 4 c_~q_back~0))) (.cse1 (+ .cse5 c_~q~0.offset)) (.cse2 (+ .cse5 c_~q~0.offset 4))) (and (forall ((v_ArrVal_4608 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4608) c_~q~0.base))) (or (< (+ c_~s~0 (select .cse0 .cse1) (select .cse0 .cse2)) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_4608 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4608) c_~q~0.base))) (or (not (= (select .cse4 .cse3) 1)) (< |c_thread1Thread1of1ForFork0_~i~0#1| (+ c_~s~0 (select .cse4 .cse1) (select .cse4 .cse2))))))))) is different from false [2022-12-06 05:44:35,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:35,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 178 [2022-12-06 05:44:35,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:35,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 128 [2022-12-06 05:44:35,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:35,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 108 [2022-12-06 05:44:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179881017] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:35,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:44:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894691216] [2022-12-06 05:44:35,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:44:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:44:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2022-12-06 05:44:35,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 68 [2022-12-06 05:44:35,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1079 transitions, 37138 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:35,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:35,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 68 [2022-12-06 05:44:35,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:39,496 INFO L130 PetriNetUnfolder]: 3698/6747 cut-off events. [2022-12-06 05:44:39,497 INFO L131 PetriNetUnfolder]: For 411232/411347 co-relation queries the response was YES. [2022-12-06 05:44:39,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89416 conditions, 6747 events. 3698/6747 cut-off events. For 411232/411347 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 50863 event pairs, 1026 based on Foata normal form. 26/6773 useless extension candidates. Maximal degree in co-relation 88266. Up to 6601 conditions per place. [2022-12-06 05:44:39,577 INFO L137 encePairwiseOnDemand]: 31/68 looper letters, 1022 selfloop transitions, 64 changer transitions 8/1095 dead transitions. [2022-12-06 05:44:39,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1095 transitions, 39415 flow [2022-12-06 05:44:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:44:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:44:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-06 05:44:39,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17647058823529413 [2022-12-06 05:44:39,578 INFO L175 Difference]: Start difference. First operand has 341 places, 1079 transitions, 37138 flow. Second operand 9 states and 108 transitions. [2022-12-06 05:44:39,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1095 transitions, 39415 flow [2022-12-06 05:44:43,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1095 transitions, 34225 flow, removed 2517 selfloop flow, removed 11 redundant places. [2022-12-06 05:44:43,265 INFO L231 Difference]: Finished difference. Result has 337 places, 1075 transitions, 31989 flow [2022-12-06 05:44:43,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=31955, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=31989, PETRI_PLACES=337, PETRI_TRANSITIONS=1075} [2022-12-06 05:44:43,266 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 316 predicate places. [2022-12-06 05:44:43,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:43,266 INFO L89 Accepts]: Start accepts. Operand has 337 places, 1075 transitions, 31989 flow [2022-12-06 05:44:43,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:43,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:43,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 337 places, 1075 transitions, 31989 flow [2022-12-06 05:44:43,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 1075 transitions, 31989 flow [2022-12-06 05:44:43,977 INFO L130 PetriNetUnfolder]: 971/2830 cut-off events. [2022-12-06 05:44:43,977 INFO L131 PetriNetUnfolder]: For 145550/146309 co-relation queries the response was YES. [2022-12-06 05:44:43,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29991 conditions, 2830 events. 971/2830 cut-off events. For 145550/146309 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 27212 event pairs, 11 based on Foata normal form. 250/3069 useless extension candidates. Maximal degree in co-relation 29618. Up to 864 conditions per place. [2022-12-06 05:44:44,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 1075 transitions, 31989 flow [2022-12-06 05:44:44,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 3676 [2022-12-06 05:44:44,030 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:44,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 765 [2022-12-06 05:44:44,031 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 1075 transitions, 31989 flow [2022-12-06 05:44:44,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:44,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:44,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:44,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-12-06 05:44:44,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-12-06 05:44:44,238 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1158941585, now seen corresponding path program 1 times [2022-12-06 05:44:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:44,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763952683] [2022-12-06 05:44:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:44,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763952683] [2022-12-06 05:44:44,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763952683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:44,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736348562] [2022-12-06 05:44:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:44,986 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-06 05:44:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:45,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 05:44:45,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:45,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:45,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:44:45,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:45,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:44:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:45,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:45,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:45,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 205 treesize of output 247 [2022-12-06 05:44:45,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:45,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 112 [2022-12-06 05:44:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736348562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:45,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:45,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:44:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161287114] [2022-12-06 05:44:45,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:45,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:44:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:44:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:44:45,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 66 [2022-12-06 05:44:45,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1075 transitions, 31989 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:45,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:45,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 66 [2022-12-06 05:44:45,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:50,093 INFO L130 PetriNetUnfolder]: 3771/6876 cut-off events. [2022-12-06 05:44:50,093 INFO L131 PetriNetUnfolder]: For 340644/340783 co-relation queries the response was YES. [2022-12-06 05:44:50,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81259 conditions, 6876 events. 3771/6876 cut-off events. For 340644/340783 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 51925 event pairs, 315 based on Foata normal form. 98/6954 useless extension candidates. Maximal degree in co-relation 80334. Up to 4523 conditions per place. [2022-12-06 05:44:50,185 INFO L137 encePairwiseOnDemand]: 17/66 looper letters, 628 selfloop transitions, 524 changer transitions 10/1163 dead transitions. [2022-12-06 05:44:50,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1163 transitions, 35671 flow [2022-12-06 05:44:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:44:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:44:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 155 transitions. [2022-12-06 05:44:50,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14678030303030304 [2022-12-06 05:44:50,186 INFO L175 Difference]: Start difference. First operand has 334 places, 1075 transitions, 31989 flow. Second operand 16 states and 155 transitions. [2022-12-06 05:44:50,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 1163 transitions, 35671 flow [2022-12-06 05:44:53,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1163 transitions, 35259 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-06 05:44:53,059 INFO L231 Difference]: Finished difference. Result has 343 places, 1106 transitions, 33378 flow [2022-12-06 05:44:53,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=31596, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=33378, PETRI_PLACES=343, PETRI_TRANSITIONS=1106} [2022-12-06 05:44:53,060 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 322 predicate places. [2022-12-06 05:44:53,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:53,060 INFO L89 Accepts]: Start accepts. Operand has 343 places, 1106 transitions, 33378 flow [2022-12-06 05:44:53,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:53,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:53,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 1106 transitions, 33378 flow [2022-12-06 05:44:53,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 1106 transitions, 33378 flow [2022-12-06 05:44:53,834 INFO L130 PetriNetUnfolder]: 993/2881 cut-off events. [2022-12-06 05:44:53,834 INFO L131 PetriNetUnfolder]: For 154220/154976 co-relation queries the response was YES. [2022-12-06 05:44:53,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31455 conditions, 2881 events. 993/2881 cut-off events. For 154220/154976 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 27716 event pairs, 14 based on Foata normal form. 244/3111 useless extension candidates. Maximal degree in co-relation 31319. Up to 902 conditions per place. [2022-12-06 05:44:53,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 341 places, 1106 transitions, 33378 flow [2022-12-06 05:44:53,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 3734 [2022-12-06 05:44:53,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [861] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_935| v_~q~0.base_624)) (.cse1 (* v_~q_front~0_1203 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_731| v_~N~0_486) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_768| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_730| (+ |v_thread1Thread1of1ForFork0_~i~0#1_731| 1)) (not (= (ite (and (<= 0 v_~q_back~0_1362) (< v_~q_back~0_1362 v_~n~0_612)) 1 0) 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1362 4) v_~q~0.offset_624)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_731|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_699| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_699|) (= v_~q_front~0_1201 (+ v_~q_front~0_1203 2)) (not (= 0 (ite (and (<= 0 v_~q_front~0_1203) (< v_~q_front~0_1203 v_~n~0_612) (< v_~q_front~0_1203 v_~q_back~0_1362)) 1 0))) (= (+ (select .cse0 (+ .cse1 v_~q~0.offset_624)) v_~s~0_1130 |v_thread2Thread1of1ForFork1_~j~0#1_768|) v_~s~0_1128) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_731| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_731|) (not (= (+ v_~s~0_1130 |v_thread2Thread1of1ForFork1_~j~0#1_768|) v_~s~0_1128)) (= (+ v_~q_back~0_1362 1) v_~q_back~0_1361) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_731| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_699| (ite (let ((.cse2 (+ v_~q_front~0_1203 1))) (and (< .cse2 v_~q_back~0_1361) (<= 0 .cse2) (< .cse2 v_~n~0_612))) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_768| (select .cse0 (+ .cse1 v_~q~0.offset_624 4))))) InVars {~q_back~0=v_~q_back~0_1362, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_731|, #memory_int=|v_#memory_int_935|, ~N~0=v_~N~0_486, ~q~0.base=v_~q~0.base_624, ~n~0=v_~n~0_612, ~q~0.offset=v_~q~0.offset_624, ~s~0=v_~s~0_1130, ~q_front~0=v_~q_front~0_1203} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_768|, ~q_back~0=v_~q_back~0_1361, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_699|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_699|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_519|, ~N~0=v_~N~0_486, ~q~0.base=v_~q~0.base_624, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_699|, ~q~0.offset=v_~q~0.offset_624, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_699|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_731|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_523|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_519|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_730|, #memory_int=|v_#memory_int_935|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_731|, ~n~0=v_~n~0_612, ~s~0=v_~s~0_1128, ~q_front~0=v_~q_front~0_1201} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:44:54,191 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,192 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,408 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,408 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,408 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,408 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,408 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,408 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [848] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_886| v_~q~0.base_605)) (.cse7 (* v_~q_front~0_1143 4))) (let ((.cse1 (+ 2 v_~q_back~0_1297)) (.cse2 (select .cse0 (+ .cse7 v_~q~0.offset_605 4))) (.cse6 (select .cse0 (+ .cse7 v_~q~0.offset_605))) (.cse3 (* v_~q_back~0_1297 4))) (and (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_685| 1) v_~N~0_470) (= (select .cse0 (+ (- 4) v_~q~0.offset_605 (* v_~q_front~0_1142 4))) |v_thread2Thread1of1ForFork1_~j~0#1_716|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_655| (ite (and (< v_~q_front~0_1142 (+ v_~n~0_596 1)) (<= 1 v_~q_front~0_1142) (< v_~q_front~0_1142 .cse1)) 1 0)) (not (= .cse2 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_716| 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_685| 2) |v_thread1Thread1of1ForFork0_~i~0#1_683|) (= v_~q_front~0_1142 (+ v_~q_front~0_1143 3)) (not (= (ite (and (< v_~q_front~0_1143 v_~n~0_596) (<= 0 v_~q_front~0_1143) (< v_~q_front~0_1143 v_~q_back~0_1297)) 1 0) 0)) (= (ite (= (select .cse0 (+ .cse3 v_~q~0.offset_605 4)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_682|) (not (= (ite (let ((.cse4 (+ v_~q_back~0_1297 1))) (and (< .cse4 v_~n~0_596) (<= 0 .cse4))) 1 0) 0)) (= .cse1 v_~q_back~0_1295) (not (= (ite (let ((.cse5 (+ v_~q_front~0_1143 1))) (and (<= 0 .cse5) (< .cse5 v_~q_back~0_1297) (< .cse5 v_~n~0_596))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_682| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_682|) (not (= 0 .cse6)) (= (+ .cse2 v_~s~0_1072 |v_thread2Thread1of1ForFork1_~j~0#1_716| .cse6) v_~s~0_1071) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_682| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_655| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_655|) (not (= (ite (= 1 (select .cse0 (+ .cse3 v_~q~0.offset_605))) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1297, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_685|, #memory_int=|v_#memory_int_886|, ~N~0=v_~N~0_470, ~q~0.base=v_~q~0.base_605, ~n~0=v_~n~0_596, ~q~0.offset=v_~q~0.offset_605, ~s~0=v_~s~0_1072, ~q_front~0=v_~q_front~0_1143} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_716|, ~q_back~0=v_~q_back~0_1295, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_655|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_485|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_655|, ~N~0=v_~N~0_470, ~q~0.base=v_~q~0.base_605, ~q~0.offset=v_~q~0.offset_605, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_655|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_655|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_682|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_489|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_485|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_683|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_682|, #memory_int=|v_#memory_int_886|, ~n~0=v_~n~0_596, ~s~0=v_~s~0_1071, ~q_front~0=v_~q_front~0_1142} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:44:54,881 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,881 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,881 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,881 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,881 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:54,881 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:44:55,275 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:55,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2216 [2022-12-06 05:44:55,276 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 1106 transitions, 33456 flow [2022-12-06 05:44:55,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:55,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:55,276 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:55,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-12-06 05:44:55,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-12-06 05:44:55,483 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash -56277934, now seen corresponding path program 1 times [2022-12-06 05:44:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:55,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408291015] [2022-12-06 05:44:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:56,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408291015] [2022-12-06 05:44:56,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408291015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:56,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839043401] [2022-12-06 05:44:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:56,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:56,251 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:56,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-06 05:44:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:56,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 05:44:56,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:56,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:44:56,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:44:56,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:56,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:44:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:56,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:56,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:56,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 243 [2022-12-06 05:44:56,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:56,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 108 [2022-12-06 05:44:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:57,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839043401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:57,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:57,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:44:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825166500] [2022-12-06 05:44:57,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:57,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:44:57,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:57,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:44:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:44:57,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 70 [2022-12-06 05:44:57,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1106 transitions, 33456 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:57,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:57,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 70 [2022-12-06 05:44:57,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:00,956 INFO L130 PetriNetUnfolder]: 3771/6875 cut-off events. [2022-12-06 05:45:00,956 INFO L131 PetriNetUnfolder]: For 366941/367045 co-relation queries the response was YES. [2022-12-06 05:45:01,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83614 conditions, 6875 events. 3771/6875 cut-off events. For 366941/367045 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 51611 event pairs, 1180 based on Foata normal form. 17/6872 useless extension candidates. Maximal degree in co-relation 83475. Up to 6751 conditions per place. [2022-12-06 05:45:01,035 INFO L137 encePairwiseOnDemand]: 28/70 looper letters, 1063 selfloop transitions, 55 changer transitions 16/1135 dead transitions. [2022-12-06 05:45:01,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1135 transitions, 35987 flow [2022-12-06 05:45:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:45:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:45:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-12-06 05:45:01,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16428571428571428 [2022-12-06 05:45:01,036 INFO L175 Difference]: Start difference. First operand has 341 places, 1106 transitions, 33456 flow. Second operand 10 states and 115 transitions. [2022-12-06 05:45:01,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1135 transitions, 35987 flow [2022-12-06 05:45:03,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1135 transitions, 35682 flow, removed 99 selfloop flow, removed 9 redundant places. [2022-12-06 05:45:04,010 INFO L231 Difference]: Finished difference. Result has 343 places, 1106 transitions, 33260 flow [2022-12-06 05:45:04,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=33151, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=33260, PETRI_PLACES=343, PETRI_TRANSITIONS=1106} [2022-12-06 05:45:04,011 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 322 predicate places. [2022-12-06 05:45:04,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:04,011 INFO L89 Accepts]: Start accepts. Operand has 343 places, 1106 transitions, 33260 flow [2022-12-06 05:45:04,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:04,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:04,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 1106 transitions, 33260 flow [2022-12-06 05:45:04,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 338 places, 1106 transitions, 33260 flow [2022-12-06 05:45:04,707 INFO L130 PetriNetUnfolder]: 994/2874 cut-off events. [2022-12-06 05:45:04,707 INFO L131 PetriNetUnfolder]: For 152811/153569 co-relation queries the response was YES. [2022-12-06 05:45:04,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31389 conditions, 2874 events. 994/2874 cut-off events. For 152811/153569 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 27404 event pairs, 11 based on Foata normal form. 248/3108 useless extension candidates. Maximal degree in co-relation 31252. Up to 902 conditions per place. [2022-12-06 05:45:04,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 338 places, 1106 transitions, 33260 flow [2022-12-06 05:45:04,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 3726 [2022-12-06 05:45:04,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [864] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_939| v_~q~0.base_628))) (and (= (+ v_~s~0_1139 |v_thread2Thread1of1ForFork1_~j~0#1_774|) v_~s~0_1138) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_737| (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1371 4) v_~q~0.offset_628)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_705| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_705|) (not (= (ite (and (< v_~q_back~0_1371 (+ v_~n~0_616 1)) (<= 1 v_~q_back~0_1371)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_737| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_738| (+ v_~N~0_490 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_705| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_737| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_737|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_705| (ite (and (< v_~q_front~0_1212 v_~n~0_616) (<= 0 v_~q_front~0_1212) (< v_~q_front~0_1212 v_~q_back~0_1373)) 1 0)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_1373 4) v_~q~0.offset_628)) 1) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_774| 0)) (= (select .cse0 (+ (* v_~q_front~0_1212 4) v_~q~0.offset_628)) |v_thread2Thread1of1ForFork1_~j~0#1_774|) (= (+ 2 v_~q_back~0_1373) v_~q_back~0_1371) (= |v_thread1Thread1of1ForFork0_~i~0#1_738| (+ |v_thread1Thread1of1ForFork0_~i~0#1_740| 2)) (= v_~q_front~0_1211 (+ v_~q_front~0_1212 1)))) InVars {~q_back~0=v_~q_back~0_1373, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_740|, #memory_int=|v_#memory_int_939|, ~N~0=v_~N~0_490, ~q~0.base=v_~q~0.base_628, ~n~0=v_~n~0_616, ~q~0.offset=v_~q~0.offset_628, ~s~0=v_~s~0_1139, ~q_front~0=v_~q_front~0_1212} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_774|, ~q_back~0=v_~q_back~0_1371, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_705|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_523|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_705|, ~N~0=v_~N~0_490, ~q~0.base=v_~q~0.base_628, ~q~0.offset=v_~q~0.offset_628, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_705|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_705|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_737|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_527|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_523|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_738|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_737|, #memory_int=|v_#memory_int_939|, ~n~0=v_~n~0_616, ~s~0=v_~s~0_1138, ~q_front~0=v_~q_front~0_1211} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:45:05,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:05,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1052 [2022-12-06 05:45:05,063 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 1106 transitions, 33289 flow [2022-12-06 05:45:05,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:05,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:05,064 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:05,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:05,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:05,275 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1707300312, now seen corresponding path program 1 times [2022-12-06 05:45:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:05,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382868157] [2022-12-06 05:45:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:06,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382868157] [2022-12-06 05:45:06,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382868157] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:06,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442162751] [2022-12-06 05:45:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:06,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:06,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:06,177 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:06,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-06 05:45:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:06,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:45:06,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:06,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:06,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:45:06,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:06,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:45:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:06,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:06,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:06,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 243 [2022-12-06 05:45:06,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:06,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 108 [2022-12-06 05:45:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:07,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442162751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:07,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:07,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:45:07,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378175797] [2022-12-06 05:45:07,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:07,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:45:07,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:45:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:45:07,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 68 [2022-12-06 05:45:07,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 1106 transitions, 33289 flow. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:07,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:07,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 68 [2022-12-06 05:45:07,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:11,360 INFO L130 PetriNetUnfolder]: 3928/7172 cut-off events. [2022-12-06 05:45:11,360 INFO L131 PetriNetUnfolder]: For 381586/381677 co-relation queries the response was YES. [2022-12-06 05:45:11,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87745 conditions, 7172 events. 3928/7172 cut-off events. For 381586/381677 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 54633 event pairs, 745 based on Foata normal form. 76/7228 useless extension candidates. Maximal degree in co-relation 87605. Up to 6602 conditions per place. [2022-12-06 05:45:11,453 INFO L137 encePairwiseOnDemand]: 33/68 looper letters, 1105 selfloop transitions, 116 changer transitions 6/1228 dead transitions. [2022-12-06 05:45:11,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1228 transitions, 38381 flow [2022-12-06 05:45:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:45:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:45:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2022-12-06 05:45:11,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13777089783281735 [2022-12-06 05:45:11,455 INFO L175 Difference]: Start difference. First operand has 338 places, 1106 transitions, 33289 flow. Second operand 19 states and 178 transitions. [2022-12-06 05:45:11,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1228 transitions, 38381 flow [2022-12-06 05:45:14,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1228 transitions, 38224 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-06 05:45:14,423 INFO L231 Difference]: Finished difference. Result has 362 places, 1141 transitions, 34682 flow [2022-12-06 05:45:14,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=33132, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=34682, PETRI_PLACES=362, PETRI_TRANSITIONS=1141} [2022-12-06 05:45:14,424 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 341 predicate places. [2022-12-06 05:45:14,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:14,424 INFO L89 Accepts]: Start accepts. Operand has 362 places, 1141 transitions, 34682 flow [2022-12-06 05:45:14,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:14,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:14,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 1141 transitions, 34682 flow [2022-12-06 05:45:14,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 362 places, 1141 transitions, 34682 flow [2022-12-06 05:45:15,189 INFO L130 PetriNetUnfolder]: 1035/3002 cut-off events. [2022-12-06 05:45:15,189 INFO L131 PetriNetUnfolder]: For 172520/173307 co-relation queries the response was YES. [2022-12-06 05:45:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33866 conditions, 3002 events. 1035/3002 cut-off events. For 172520/173307 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 29069 event pairs, 17 based on Foata normal form. 270/3253 useless extension candidates. Maximal degree in co-relation 33463. Up to 965 conditions per place. [2022-12-06 05:45:15,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 1141 transitions, 34682 flow [2022-12-06 05:45:15,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 3924 [2022-12-06 05:45:15,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [823] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_843| v_~q~0.base_575)) (.cse1 (* v_~q_back~0_1197 4))) (and (= (+ 5 v_~q_back~0_1197) v_~q_back~0_1195) (= v_~q_front~0_1028 (+ v_~q_front~0_1029 1)) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_575)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_578| (ite (and (< v_~q_front~0_1029 (+ 3 v_~q_back~0_1197)) (< v_~q_front~0_1029 v_~n~0_566) (<= 0 v_~q_front~0_1029)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_578| 0)) (= (+ v_~s~0_957 |v_thread2Thread1of1ForFork1_~j~0#1_630|) v_~s~0_956) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_630| 0)) (= (ite (= (select .cse0 (+ .cse1 16 v_~q~0.offset_575)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_610|) (< |v_thread1Thread1of1ForFork0_~i~0#1_617| (+ v_~N~0_442 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_610| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_578| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_578|) (= |v_thread1Thread1of1ForFork0_#res#1.base_256| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_617| v_~N~0_442)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_610| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_610|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_575)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1197 4))) (and (<= 0 .cse2) (< .cse2 v_~n~0_566))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_256| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_617| 4) (= |v_thread2Thread1of1ForFork1_~j~0#1_630| (select .cse0 (+ (* v_~q_front~0_1029 4) v_~q~0.offset_575))) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_575 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_575)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1197 v_~n~0_566) (<= 0 v_~q_back~0_1197)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1197, #memory_int=|v_#memory_int_843|, ~N~0=v_~N~0_442, ~q~0.base=v_~q~0.base_575, ~n~0=v_~n~0_566, ~q~0.offset=v_~q~0.offset_575, ~s~0=v_~s~0_957, ~q_front~0=v_~q_front~0_1029} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_630|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_256|, ~q_back~0=v_~q_back~0_1195, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_274|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_578|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_425|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_578|, ~N~0=v_~N~0_442, ~q~0.base=v_~q~0.base_575, ~q~0.offset=v_~q~0.offset_575, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_578|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_578|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_610|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_429|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_425|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_617|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_610|, #memory_int=|v_#memory_int_843|, ~n~0=v_~n~0_566, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_256|, ~s~0=v_~s~0_956, ~q_front~0=v_~q_front~0_1028} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:45:16,047 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,047 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,126 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,126 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,211 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,211 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [817] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_829| v_~q~0.base_565)) (.cse1 (* v_~q_back~0_1171 4))) (and (< |v_thread1Thread1of1ForFork0_~i~0#1_605| (+ v_~N~0_432 1)) (= (+ 3 v_~q_back~0_1171) v_~q_back~0_1169) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565 4)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_565)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_605| 3) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_565)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|) (not (= (ite (and (< v_~q_back~0_1171 v_~n~0_556) (<= 0 v_~q_back~0_1171)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1171))) (and (<= 0 .cse2) (< .cse2 v_~n~0_556))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1171, #memory_int=|v_#memory_int_829|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_594|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_417|, ~q_back~0=v_~q_back~0_1169, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_413|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_605|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_594|, #memory_int=|v_#memory_int_829|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_413|, ~N~0=v_~N~0_432, ~q~0.base=v_~q~0.base_565, ~n~0=v_~n~0_556, ~q~0.offset=v_~q~0.offset_565} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:45:16,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_648| v_~q~0.base_438)) (.cse1 (* v_~q_back~0_873 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_438)) 1) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415| 0)) (not (= 0 (ite (and (<= 0 v_~q_back~0_873) (< v_~q_back~0_873 v_~n~0_434)) 1 0))) (< 2 v_~N~0_330) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_445| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|) (= (+ 3 v_~q_back~0_873) v_~q_back~0_871) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_438 4)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_873))) (and (<= 0 .cse2) (< .cse2 v_~n~0_434))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_873, #memory_int=|v_#memory_int_648|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_291|, ~q_back~0=v_~q_back~0_871, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_287|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_445|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|, #memory_int=|v_#memory_int_648|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_287|, ~N~0=v_~N~0_330, ~q~0.base=v_~q~0.base_438, ~n~0=v_~n~0_434, ~q~0.offset=v_~q~0.offset_438} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [527] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre14#1_23|)) |v_#memory_int_130|) (= |v_ULTIMATE.start_main_#t~pre14#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_23|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:45:16,504 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,505 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,580 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,580 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,695 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,695 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:16,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_1207 4)) (.cse0 (select |v_#memory_int_847| v_~q~0.base_579))) (and (not (= (ite (= (select .cse0 (+ v_~q~0.offset_579 .cse1 4)) 1) 1 0) 0)) (= (+ 5 v_~q_back~0_1207) v_~q_back~0_1205) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_584| 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_579 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_616|) (= |v_thread1Thread1of1ForFork0_~i~0#1_621| 5) (< |v_thread1Thread1of1ForFork0_~i~0#1_621| (+ v_~N~0_446 1)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1207 4))) (and (<= 0 .cse2) (< .cse2 v_~n~0_570))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_636| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_584| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_584|) (= v_~q_front~0_1038 (+ v_~q_front~0_1039 1)) (not (= (ite (= 1 (select .cse0 (+ 12 v_~q~0.offset_579 .cse1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_616| 0)) (= (ite (= (select .cse0 (+ 16 v_~q~0.offset_579 .cse1)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_584| (ite (and (< v_~q_front~0_1039 v_~n~0_570) (<= 0 v_~q_front~0_1039) (< v_~q_front~0_1039 (+ 3 v_~q_back~0_1207))) 1 0)) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_579 .cse1)) 1) 1 0) 0)) (= (+ v_~s~0_967 |v_thread2Thread1of1ForFork1_~j~0#1_636|) v_~s~0_966) (not (= (ite (and (< v_~q_back~0_1207 v_~n~0_570) (<= 0 v_~q_back~0_1207)) 1 0) 0)) (= (select .cse0 (+ (* v_~q_front~0_1039 4) v_~q~0.offset_579)) |v_thread2Thread1of1ForFork1_~j~0#1_636|))) InVars {~q_back~0=v_~q_back~0_1207, #memory_int=|v_#memory_int_847|, ~N~0=v_~N~0_446, ~q~0.base=v_~q~0.base_579, ~n~0=v_~n~0_570, ~q~0.offset=v_~q~0.offset_579, ~s~0=v_~s~0_967, ~q_front~0=v_~q_front~0_1039} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_636|, ~q_back~0=v_~q_back~0_1205, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_584|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_429|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_584|, ~N~0=v_~N~0_446, ~q~0.base=v_~q~0.base_579, ~q~0.offset=v_~q~0.offset_579, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_584|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_584|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_433|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_429|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_621|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_616|, #memory_int=|v_#memory_int_847|, ~n~0=v_~n~0_570, ~s~0=v_~s~0_966, ~q_front~0=v_~q_front~0_1038} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:45:17,424 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,424 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,424 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,424 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,424 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,424 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,425 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,425 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,425 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:17,425 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:18,534 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:18,534 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:18,723 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:18,724 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:18,982 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 05:45:18,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4559 [2022-12-06 05:45:18,983 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 1134 transitions, 34661 flow [2022-12-06 05:45:18,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:18,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:18,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:18,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:19,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:19,189 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash 35759028, now seen corresponding path program 1 times [2022-12-06 05:45:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132970047] [2022-12-06 05:45:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132970047] [2022-12-06 05:45:19,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132970047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712856960] [2022-12-06 05:45:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:19,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:19,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:19,618 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:19,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-06 05:45:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:45:19,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:20,003 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:45:20,004 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 27 treesize of output 18 [2022-12-06 05:45:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:20,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712856960] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:20,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:20,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 05:45:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455635826] [2022-12-06 05:45:20,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:20,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:45:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:45:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:45:20,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2022-12-06 05:45:20,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 1134 transitions, 34661 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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 05:45:20,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:20,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2022-12-06 05:45:20,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:24,327 INFO L130 PetriNetUnfolder]: 4138/7511 cut-off events. [2022-12-06 05:45:24,327 INFO L131 PetriNetUnfolder]: For 435370/435474 co-relation queries the response was YES. [2022-12-06 05:45:24,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93513 conditions, 7511 events. 4138/7511 cut-off events. For 435370/435474 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 57330 event pairs, 521 based on Foata normal form. 102/7593 useless extension candidates. Maximal degree in co-relation 92826. Up to 5336 conditions per place. [2022-12-06 05:45:24,441 INFO L137 encePairwiseOnDemand]: 20/75 looper letters, 837 selfloop transitions, 455 changer transitions 0/1293 dead transitions. [2022-12-06 05:45:24,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1293 transitions, 41024 flow [2022-12-06 05:45:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:45:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:45:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-12-06 05:45:24,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13955555555555554 [2022-12-06 05:45:24,442 INFO L175 Difference]: Start difference. First operand has 355 places, 1134 transitions, 34661 flow. Second operand 15 states and 157 transitions. [2022-12-06 05:45:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1293 transitions, 41024 flow [2022-12-06 05:45:27,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1293 transitions, 40462 flow, removed 262 selfloop flow, removed 8 redundant places. [2022-12-06 05:45:28,016 INFO L231 Difference]: Finished difference. Result has 366 places, 1198 transitions, 37802 flow [2022-12-06 05:45:28,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=34085, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=400, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=37802, PETRI_PLACES=366, PETRI_TRANSITIONS=1198} [2022-12-06 05:45:28,016 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 345 predicate places. [2022-12-06 05:45:28,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:28,017 INFO L89 Accepts]: Start accepts. Operand has 366 places, 1198 transitions, 37802 flow [2022-12-06 05:45:28,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:28,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:28,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 366 places, 1198 transitions, 37802 flow [2022-12-06 05:45:28,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 366 places, 1198 transitions, 37802 flow [2022-12-06 05:45:29,068 INFO L130 PetriNetUnfolder]: 1092/3141 cut-off events. [2022-12-06 05:45:29,069 INFO L131 PetriNetUnfolder]: For 187520/188366 co-relation queries the response was YES. [2022-12-06 05:45:29,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35923 conditions, 3141 events. 1092/3141 cut-off events. For 187520/188366 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 30632 event pairs, 14 based on Foata normal form. 287/3415 useless extension candidates. Maximal degree in co-relation 35619. Up to 1002 conditions per place. [2022-12-06 05:45:29,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 366 places, 1198 transitions, 37802 flow [2022-12-06 05:45:29,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 4134 [2022-12-06 05:45:29,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:29,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1106 [2022-12-06 05:45:29,123 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1198 transitions, 37802 flow [2022-12-06 05:45:29,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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 05:45:29,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:29,123 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:29,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:29,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2022-12-06 05:45:29,332 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1238451183, now seen corresponding path program 1 times [2022-12-06 05:45:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:29,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281077858] [2022-12-06 05:45:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:31,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:31,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281077858] [2022-12-06 05:45:31,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281077858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:31,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687358626] [2022-12-06 05:45:31,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:31,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:31,096 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:31,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-06 05:45:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:31,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 05:45:31,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:31,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:31,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:45:31,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:31,587 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 12 [2022-12-06 05:45:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:31,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:31,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:31,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 136 [2022-12-06 05:45:31,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:31,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 62 [2022-12-06 05:45:31,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:31,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 49 [2022-12-06 05:45:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:45:31,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687358626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:31,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:31,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2022-12-06 05:45:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636168820] [2022-12-06 05:45:31,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:31,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:45:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:45:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:45:31,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 05:45:31,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1198 transitions, 37802 flow. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:31,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:31,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 05:45:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:36,330 INFO L130 PetriNetUnfolder]: 4150/7539 cut-off events. [2022-12-06 05:45:36,331 INFO L131 PetriNetUnfolder]: For 431884/431957 co-relation queries the response was YES. [2022-12-06 05:45:36,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95578 conditions, 7539 events. 4150/7539 cut-off events. For 431884/431957 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 57395 event pairs, 1204 based on Foata normal form. 16/7535 useless extension candidates. Maximal degree in co-relation 94792. Up to 7340 conditions per place. [2022-12-06 05:45:36,439 INFO L137 encePairwiseOnDemand]: 33/74 looper letters, 1147 selfloop transitions, 52 changer transitions 54/1254 dead transitions. [2022-12-06 05:45:36,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 1254 transitions, 40906 flow [2022-12-06 05:45:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:45:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:45:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 168 transitions. [2022-12-06 05:45:36,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15135135135135136 [2022-12-06 05:45:36,440 INFO L175 Difference]: Start difference. First operand has 366 places, 1198 transitions, 37802 flow. Second operand 15 states and 168 transitions. [2022-12-06 05:45:36,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 1254 transitions, 40906 flow [2022-12-06 05:45:40,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 1254 transitions, 40465 flow, removed 195 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:40,630 INFO L231 Difference]: Finished difference. Result has 382 places, 1186 transitions, 37033 flow [2022-12-06 05:45:40,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=37361, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=37033, PETRI_PLACES=382, PETRI_TRANSITIONS=1186} [2022-12-06 05:45:40,631 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 361 predicate places. [2022-12-06 05:45:40,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:40,631 INFO L89 Accepts]: Start accepts. Operand has 382 places, 1186 transitions, 37033 flow [2022-12-06 05:45:40,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:40,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:40,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 382 places, 1186 transitions, 37033 flow [2022-12-06 05:45:40,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 1186 transitions, 37033 flow [2022-12-06 05:45:41,553 INFO L130 PetriNetUnfolder]: 1086/3095 cut-off events. [2022-12-06 05:45:41,554 INFO L131 PetriNetUnfolder]: For 180669/181439 co-relation queries the response was YES. [2022-12-06 05:45:41,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35495 conditions, 3095 events. 1086/3095 cut-off events. For 180669/181439 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 29917 event pairs, 14 based on Foata normal form. 267/3349 useless extension candidates. Maximal degree in co-relation 35333. Up to 989 conditions per place. [2022-12-06 05:45:41,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 1186 transitions, 37033 flow [2022-12-06 05:45:41,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 4078 [2022-12-06 05:45:41,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [845] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (+ v_~q_front~0_1128 1)) (.cse2 (* v_~q_back~0_1283 4)) (.cse1 (select |v_#memory_int_880| v_~q~0.base_601))) (and (= v_~q_front~0_1127 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_673| (+ v_~N~0_466 1)) (not (= 0 (ite (and (<= 1 v_~q_back~0_1281) (< v_~q_back~0_1281 (+ v_~n~0_592 1))) 1 0))) (= (+ v_~q_back~0_1283 4) v_~q_back~0_1281) (not (= (ite (and (<= 0 v_~q_back~0_1283) (< v_~q_back~0_1283 v_~n~0_592)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_645| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_645|) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_601 4 .cse2)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672| 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_601 .cse2)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_673| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_645| (ite (and (< .cse0 v_~q_back~0_1281) (<= 0 v_~q_front~0_1128) (< v_~q_front~0_1128 v_~n~0_592)) 1 0)) (= (+ v_~s~0_1056 |v_thread2Thread1of1ForFork1_~j~0#1_705|) v_~s~0_1055) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_705| 0)) (= (select .cse1 (+ (* v_~q_front~0_1128 4) v_~q~0.offset_601)) |v_thread2Thread1of1ForFork1_~j~0#1_705|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672|) (not (= 0 (ite (= 1 (select .cse1 (+ 8 v_~q~0.offset_601 .cse2))) 1 0))) (= (ite (= (select .cse1 (+ (* v_~q_back~0_1281 4) (- 4) v_~q~0.offset_601)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_645| 0)))) InVars {~q_back~0=v_~q_back~0_1283, #memory_int=|v_#memory_int_880|, ~N~0=v_~N~0_466, ~q~0.base=v_~q~0.base_601, ~n~0=v_~n~0_592, ~q~0.offset=v_~q~0.offset_601, ~s~0=v_~s~0_1056, ~q_front~0=v_~q_front~0_1128} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_705|, ~q_back~0=v_~q_back~0_1281, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_645|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_476|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_645|, ~N~0=v_~N~0_466, ~q~0.base=v_~q~0.base_601, ~q~0.offset=v_~q~0.offset_601, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_645|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_645|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_480|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_476|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_673|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672|, #memory_int=|v_#memory_int_880|, ~n~0=v_~n~0_592, ~s~0=v_~s~0_1055, ~q_front~0=v_~q_front~0_1127} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:45:42,136 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:42,136 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:42,136 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:42,136 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:42,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] L65-2-->L47-4: Formula: (let ((.cse3 (select |v_#memory_int_872| v_~q~0.base_595)) (.cse5 (* v_~q_front~0_1104 4))) (let ((.cse4 (* v_~q_back~0_1259 4)) (.cse0 (select .cse3 (+ .cse5 v_~q~0.offset_595)))) (and (not (= .cse0 0)) (= (ite (let ((.cse1 (+ v_~q_front~0_1104 1))) (and (<= 0 .cse1) (< .cse1 v_~n~0_586) (< .cse1 v_~q_back~0_1259))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629|) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1259 1))) (and (< .cse2 v_~n~0_586) (<= 0 .cse2))) 1 0) 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_657| 1) v_~N~0_460) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_629|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_629| 0)) (not (= (ite (= (select .cse3 (+ v_~q~0.offset_595 .cse4)) 1) 1 0) 0)) (= v_~q_back~0_1257 (+ 2 v_~q_back~0_1259)) (= (+ v_~q_front~0_1104 2) v_~q_front~0_1103) (= |v_thread1Thread1of1ForFork0_~i~0#1_655| (+ |v_thread1Thread1of1ForFork0_~i~0#1_657| 2)) (not (= (ite (and (< v_~q_front~0_1104 v_~q_back~0_1259) (< v_~q_front~0_1104 v_~n~0_586) (<= 0 v_~q_front~0_1104)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_655| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_655|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_687| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_655| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_655| (ite (= (select .cse3 (+ v_~q~0.offset_595 4 .cse4)) 1) 1 0)) (= (+ .cse0 v_~s~0_1032 |v_thread2Thread1of1ForFork1_~j~0#1_687|) v_~s~0_1031) (= (select .cse3 (+ .cse5 v_~q~0.offset_595 4)) |v_thread2Thread1of1ForFork1_~j~0#1_687|)))) InVars {~q_back~0=v_~q_back~0_1259, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_657|, #memory_int=|v_#memory_int_872|, ~N~0=v_~N~0_460, ~q~0.base=v_~q~0.base_595, ~n~0=v_~n~0_586, ~q~0.offset=v_~q~0.offset_595, ~s~0=v_~s~0_1032, ~q_front~0=v_~q_front~0_1104} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_687|, ~q_back~0=v_~q_back~0_1257, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_462|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_629|, ~N~0=v_~N~0_460, ~q~0.base=v_~q~0.base_595, ~q~0.offset=v_~q~0.offset_595, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_629|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_629|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_655|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_466|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_462|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_655|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_655|, #memory_int=|v_#memory_int_872|, ~n~0=v_~n~0_586, ~s~0=v_~s~0_1031, ~q_front~0=v_~q_front~0_1103} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:45:43,394 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:43,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2765 [2022-12-06 05:45:43,396 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1186 transitions, 37119 flow [2022-12-06 05:45:43,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:43,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:43,396 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:43,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:43,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:43,597 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1962779408, now seen corresponding path program 1 times [2022-12-06 05:45:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:43,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925227200] [2022-12-06 05:45:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:43,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:43,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925227200] [2022-12-06 05:45:43,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925227200] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:43,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177620289] [2022-12-06 05:45:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:43,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:43,721 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:43,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-06 05:45:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:44,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:45:44,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:44,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:45:44,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177620289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:44,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:45:44,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-12-06 05:45:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757339179] [2022-12-06 05:45:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:44,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:45:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:45:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:45:44,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2022-12-06 05:45:44,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1186 transitions, 37119 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:45:44,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:44,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2022-12-06 05:45:44,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:49,150 INFO L130 PetriNetUnfolder]: 5417/9874 cut-off events. [2022-12-06 05:45:49,151 INFO L131 PetriNetUnfolder]: For 587710/587794 co-relation queries the response was YES. [2022-12-06 05:45:49,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125731 conditions, 9874 events. 5417/9874 cut-off events. For 587710/587794 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 78119 event pairs, 432 based on Foata normal form. 60/9894 useless extension candidates. Maximal degree in co-relation 125551. Up to 3880 conditions per place. [2022-12-06 05:45:49,295 INFO L137 encePairwiseOnDemand]: 27/75 looper letters, 569 selfloop transitions, 980 changer transitions 30/1580 dead transitions. [2022-12-06 05:45:49,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1580 transitions, 51982 flow [2022-12-06 05:45:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-06 05:45:49,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2688888888888889 [2022-12-06 05:45:49,296 INFO L175 Difference]: Start difference. First operand has 373 places, 1186 transitions, 37119 flow. Second operand 6 states and 121 transitions. [2022-12-06 05:45:49,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1580 transitions, 51982 flow [2022-12-06 05:45:54,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1580 transitions, 51174 flow, removed 42 selfloop flow, removed 13 redundant places. [2022-12-06 05:45:54,431 INFO L231 Difference]: Finished difference. Result has 369 places, 1505 transitions, 50392 flow [2022-12-06 05:45:54,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=36491, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=700, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=50392, PETRI_PLACES=369, PETRI_TRANSITIONS=1505} [2022-12-06 05:45:54,432 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 348 predicate places. [2022-12-06 05:45:54,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:54,432 INFO L89 Accepts]: Start accepts. Operand has 369 places, 1505 transitions, 50392 flow [2022-12-06 05:45:54,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:54,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:54,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 1505 transitions, 50392 flow [2022-12-06 05:45:54,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 1505 transitions, 50392 flow [2022-12-06 05:45:55,967 INFO L130 PetriNetUnfolder]: 1412/4031 cut-off events. [2022-12-06 05:45:55,968 INFO L131 PetriNetUnfolder]: For 285196/287289 co-relation queries the response was YES. [2022-12-06 05:45:55,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50102 conditions, 4031 events. 1412/4031 cut-off events. For 285196/287289 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 40418 event pairs, 14 based on Foata normal form. 507/4517 useless extension candidates. Maximal degree in co-relation 49898. Up to 1392 conditions per place. [2022-12-06 05:45:56,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 1505 transitions, 50392 flow [2022-12-06 05:45:56,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 5194 [2022-12-06 05:45:56,063 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,063 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,064 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,064 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,064 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,064 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_859| v_~q~0.base_587)) (.cse1 (* v_~q_back~0_1228 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_587)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ v_~N~0_452 1)) (= v_~q_front~0_1063 (+ v_~q_front~0_1064 1)) (not (= (ite (and (< v_~q_back~0_1228 v_~n~0_578) (<= 0 v_~q_back~0_1228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| 3) (= (select .cse0 (+ (* v_~q_front~0_1064 4) v_~q~0.offset_587)) |v_thread2Thread1of1ForFork1_~j~0#1_656|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602| (ite (and (< v_~q_front~0_1064 v_~q_back~0_1227) (< v_~q_front~0_1064 v_~n~0_578) (<= 0 v_~q_front~0_1064)) 1 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1228))) (and (< .cse2 v_~n~0_578) (<= 0 .cse2))) 1 0) 0)) (= (+ 3 v_~q_back~0_1228) v_~q_back~0_1227) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_587 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_587)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_656| 0)) (= (+ v_~s~0_992 |v_thread2Thread1of1ForFork1_~j~0#1_656|) v_~s~0_991) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602| 0)))) InVars {~q_back~0=v_~q_back~0_1228, #memory_int=|v_#memory_int_859|, ~N~0=v_~N~0_452, ~q~0.base=v_~q~0.base_587, ~n~0=v_~n~0_578, ~q~0.offset=v_~q~0.offset_587, ~s~0=v_~s~0_992, ~q_front~0=v_~q_front~0_1064} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_656|, ~q_back~0=v_~q_back~0_1227, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_602|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_443|, ~N~0=v_~N~0_452, ~q~0.base=v_~q~0.base_587, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_602|, ~q~0.offset=v_~q~0.offset_587, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_447|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_443|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, #memory_int=|v_#memory_int_859|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631|, ~n~0=v_~n~0_578, ~s~0=v_~s~0_991, ~q_front~0=v_~q_front~0_1063} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:45:56,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_859| v_~q~0.base_587)) (.cse1 (* v_~q_back~0_1228 4))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_587)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ v_~N~0_452 1)) (= v_~q_front~0_1063 (+ v_~q_front~0_1064 1)) (not (= (ite (and (< v_~q_back~0_1228 v_~n~0_578) (<= 0 v_~q_back~0_1228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| 3) (= (select .cse0 (+ (* v_~q_front~0_1064 4) v_~q~0.offset_587)) |v_thread2Thread1of1ForFork1_~j~0#1_656|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602| (ite (and (< v_~q_front~0_1064 v_~q_back~0_1227) (< v_~q_front~0_1064 v_~n~0_578) (<= 0 v_~q_front~0_1064)) 1 0)) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1228))) (and (< .cse2 v_~n~0_578) (<= 0 .cse2))) 1 0) 0)) (= (+ 3 v_~q_back~0_1228) v_~q_back~0_1227) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_587 4)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631| (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_587)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_656| 0)) (= (+ v_~s~0_992 |v_thread2Thread1of1ForFork1_~j~0#1_656|) v_~s~0_991) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602| 0)))) InVars {~q_back~0=v_~q_back~0_1228, #memory_int=|v_#memory_int_859|, ~N~0=v_~N~0_452, ~q~0.base=v_~q~0.base_587, ~n~0=v_~n~0_578, ~q~0.offset=v_~q~0.offset_587, ~s~0=v_~s~0_992, ~q_front~0=v_~q_front~0_1064} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_656|, ~q_back~0=v_~q_back~0_1227, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_602|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_602|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_443|, ~N~0=v_~N~0_452, ~q~0.base=v_~q~0.base_587, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_602|, ~q~0.offset=v_~q~0.offset_587, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_602|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_631|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_447|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_443|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, #memory_int=|v_#memory_int_859|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_631|, ~n~0=v_~n~0_578, ~s~0=v_~s~0_991, ~q_front~0=v_~q_front~0_1063} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:45:56,700 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,700 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,700 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,700 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,700 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:56,700 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:57,042 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:57,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2611 [2022-12-06 05:45:57,043 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 1505 transitions, 50498 flow [2022-12-06 05:45:57,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:45:57,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:57,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:57,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:57,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:57,249 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:57,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1561966776, now seen corresponding path program 1 times [2022-12-06 05:45:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:57,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152273245] [2022-12-06 05:45:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:58,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152273245] [2022-12-06 05:45:58,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152273245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:58,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717103833] [2022-12-06 05:45:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:58,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:58,130 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:58,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-06 05:45:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:58,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 05:45:58,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:58,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:58,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:45:58,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:58,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 20 [2022-12-06 05:45:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:58,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:58,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:58,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 271 treesize of output 382 [2022-12-06 05:45:58,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:58,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 198 [2022-12-06 05:46:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:00,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717103833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:00,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:00,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:46:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805031074] [2022-12-06 05:46:00,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:00,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:46:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:46:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:46:00,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-06 05:46:00,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1505 transitions, 50498 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:00,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:00,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-06 05:46:00,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:06,420 INFO L130 PetriNetUnfolder]: 5348/9748 cut-off events. [2022-12-06 05:46:06,420 INFO L131 PetriNetUnfolder]: For 609168/609221 co-relation queries the response was YES. [2022-12-06 05:46:06,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132700 conditions, 9748 events. 5348/9748 cut-off events. For 609168/609221 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 76452 event pairs, 1688 based on Foata normal form. 6/9714 useless extension candidates. Maximal degree in co-relation 132299. Up to 9502 conditions per place. [2022-12-06 05:46:06,545 INFO L137 encePairwiseOnDemand]: 21/73 looper letters, 1432 selfloop transitions, 100 changer transitions 13/1546 dead transitions. [2022-12-06 05:46:06,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1546 transitions, 53967 flow [2022-12-06 05:46:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:46:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:46:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 142 transitions. [2022-12-06 05:46:06,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13894324853228962 [2022-12-06 05:46:06,546 INFO L175 Difference]: Start difference. First operand has 363 places, 1505 transitions, 50498 flow. Second operand 14 states and 142 transitions. [2022-12-06 05:46:06,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 1546 transitions, 53967 flow [2022-12-06 05:46:12,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1546 transitions, 52731 flow, removed 545 selfloop flow, removed 10 redundant places. [2022-12-06 05:46:12,785 INFO L231 Difference]: Finished difference. Result has 369 places, 1508 transitions, 49520 flow [2022-12-06 05:46:12,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=49262, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=49520, PETRI_PLACES=369, PETRI_TRANSITIONS=1508} [2022-12-06 05:46:12,786 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 348 predicate places. [2022-12-06 05:46:12,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:12,786 INFO L89 Accepts]: Start accepts. Operand has 369 places, 1508 transitions, 49520 flow [2022-12-06 05:46:12,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:12,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:12,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 1508 transitions, 49520 flow [2022-12-06 05:46:12,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 366 places, 1508 transitions, 49520 flow [2022-12-06 05:46:13,989 INFO L130 PetriNetUnfolder]: 1411/4041 cut-off events. [2022-12-06 05:46:13,990 INFO L131 PetriNetUnfolder]: For 266204/268258 co-relation queries the response was YES. [2022-12-06 05:46:14,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47758 conditions, 4041 events. 1411/4041 cut-off events. For 266204/268258 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 40415 event pairs, 15 based on Foata normal form. 516/4537 useless extension candidates. Maximal degree in co-relation 47344. Up to 1394 conditions per place. [2022-12-06 05:46:14,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 366 places, 1508 transitions, 49520 flow [2022-12-06 05:46:14,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 5196 [2022-12-06 05:46:14,082 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,083 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,083 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,083 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,083 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,083 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_756| v_~q~0.base_513))) (and (= (+ 1 v_~q_front~0_904) v_~q_front~0_903) (= |v_thread1Thread1of1ForFork0_~i~0#1_526| (+ |v_thread1Thread1of1ForFork0_~i~0#1_527| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498| (ite (and (< v_~q_front~0_904 v_~q_back~0_1032) (< v_~q_front~0_904 v_~n~0_504) (<= 0 v_~q_front~0_904)) 1 0)) (not (= (ite (and (<= 0 v_~q_back~0_1032) (< v_~q_back~0_1032 v_~n~0_504)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507| 0)) (= (+ v_~s~0_830 |v_thread2Thread1of1ForFork1_~j~0#1_544|) v_~s~0_829) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_544| 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_527| v_~N~0_382) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507| (ite (= (select .cse0 (+ (* v_~q_back~0_1032 4) v_~q~0.offset_513)) 1) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498| 0)) (= (select .cse0 (+ (* 4 v_~q_front~0_904) v_~q~0.offset_513)) |v_thread2Thread1of1ForFork1_~j~0#1_544|) (= (+ v_~q_back~0_1032 1) v_~q_back~0_1031))) InVars {~q_back~0=v_~q_back~0_1032, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_527|, #memory_int=|v_#memory_int_756|, ~N~0=v_~N~0_382, ~q~0.base=v_~q~0.base_513, ~n~0=v_~n~0_504, ~q~0.offset=v_~q~0.offset_513, ~s~0=v_~s~0_830, ~q_front~0=v_~q_front~0_904} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_544|, ~q_back~0=v_~q_back~0_1031, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_498|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_351|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_498|, ~N~0=v_~N~0_382, ~q~0.base=v_~q~0.base_513, ~q~0.offset=v_~q~0.offset_513, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_498|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_498|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_507|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_355|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_351|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_526|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_507|, #memory_int=|v_#memory_int_756|, ~n~0=v_~n~0_504, ~s~0=v_~s~0_829, ~q_front~0=v_~q_front~0_903} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:46:14,314 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,314 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,314 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,314 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,314 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,314 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:14,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_949| v_~q~0.base_634)) (.cse6 (* v_~q_front~0_1234 4))) (let ((.cse1 (* v_~q_back~0_1398 4)) (.cse4 (select .cse0 (+ v_~q~0.offset_634 4 .cse6))) (.cse3 (select .cse0 (+ v_~q~0.offset_634 .cse6))) (.cse2 (+ v_~n~0_622 1))) (and (not (= (ite (= (select .cse0 (+ v_~q~0.offset_634 .cse1 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_634 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_755| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_755|) (= (select .cse0 (+ (- 4) v_~q~0.offset_634 (* v_~q_front~0_1233 4))) |v_thread2Thread1of1ForFork1_~j~0#1_792|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_755| (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1396 4) v_~q~0.offset_634)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_721| (ite (and (<= 1 v_~q_front~0_1233) (< v_~q_front~0_1233 (+ 2 v_~q_back~0_1398)) (< v_~q_front~0_1233 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_721| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_721|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_755| 0)) (not (= .cse3 0)) (not (= .cse4 0)) (= v_~s~0_1164 (+ .cse4 .cse3 v_~s~0_1165 |v_thread2Thread1of1ForFork1_~j~0#1_792|)) (not (= (ite (and (< v_~q_back~0_1396 .cse2) (<= 1 v_~q_back~0_1396)) 1 0) 0)) (= (+ 3 v_~q_back~0_1398) v_~q_back~0_1396) (= |v_thread1Thread1of1ForFork0_~i~0#1_762| (+ |v_thread1Thread1of1ForFork0_~i~0#1_764| 3)) (not (= (ite (and (< v_~q_front~0_1234 v_~n~0_622) (< v_~q_front~0_1234 v_~q_back~0_1398) (<= 0 v_~q_front~0_1234)) 1 0) 0)) (= v_~q_front~0_1233 (+ v_~q_front~0_1234 3)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_792| 0)) (not (= (ite (let ((.cse5 (+ v_~q_front~0_1234 1))) (and (< .cse5 v_~n~0_622) (<= 0 .cse5) (< .cse5 v_~q_back~0_1398))) 1 0) 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_764| 2) v_~N~0_496)))) InVars {~q_back~0=v_~q_back~0_1398, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_764|, #memory_int=|v_#memory_int_949|, ~N~0=v_~N~0_496, ~q~0.base=v_~q~0.base_634, ~n~0=v_~n~0_622, ~q~0.offset=v_~q~0.offset_634, ~s~0=v_~s~0_1165, ~q_front~0=v_~q_front~0_1234} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_792|, ~q_back~0=v_~q_back~0_1396, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_721|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_539|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_721|, ~N~0=v_~N~0_496, ~q~0.base=v_~q~0.base_634, ~q~0.offset=v_~q~0.offset_634, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_721|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_721|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_755|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_543|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_539|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_762|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_755|, #memory_int=|v_#memory_int_949|, ~n~0=v_~n~0_622, ~s~0=v_~s~0_1164, ~q_front~0=v_~q_front~0_1233} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:46:16,050 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:16,051 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:16,051 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:16,051 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:16,524 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:16,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3739 [2022-12-06 05:46:16,525 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1508 transitions, 49633 flow [2022-12-06 05:46:16,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:16,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:16,525 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:16,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:16,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2022-12-06 05:46:16,726 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash -82177814, now seen corresponding path program 1 times [2022-12-06 05:46:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:16,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034672574] [2022-12-06 05:46:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034672574] [2022-12-06 05:46:17,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034672574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688519227] [2022-12-06 05:46:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:17,368 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:17,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-06 05:46:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:17,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 05:46:17,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:17,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:17,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:46:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:17,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:17,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:17,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 150 [2022-12-06 05:46:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:18,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688519227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:18,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:18,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 05:46:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392818924] [2022-12-06 05:46:18,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:18,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:46:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:46:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:46:18,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 78 [2022-12-06 05:46:18,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1508 transitions, 49633 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:18,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:18,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 78 [2022-12-06 05:46:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:23,628 INFO L130 PetriNetUnfolder]: 5345/9727 cut-off events. [2022-12-06 05:46:23,628 INFO L131 PetriNetUnfolder]: For 557463/557525 co-relation queries the response was YES. [2022-12-06 05:46:23,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127110 conditions, 9727 events. 5345/9727 cut-off events. For 557463/557525 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 76759 event pairs, 1095 based on Foata normal form. 52/9739 useless extension candidates. Maximal degree in co-relation 126093. Up to 9620 conditions per place. [2022-12-06 05:46:23,820 INFO L137 encePairwiseOnDemand]: 40/78 looper letters, 1458 selfloop transitions, 51 changer transitions 17/1527 dead transitions. [2022-12-06 05:46:23,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1527 transitions, 52876 flow [2022-12-06 05:46:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:46:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:46:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-06 05:46:23,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19963369963369965 [2022-12-06 05:46:23,821 INFO L175 Difference]: Start difference. First operand has 366 places, 1508 transitions, 49633 flow. Second operand 7 states and 109 transitions. [2022-12-06 05:46:23,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1527 transitions, 52876 flow [2022-12-06 05:46:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1527 transitions, 52723 flow, removed 33 selfloop flow, removed 6 redundant places. [2022-12-06 05:46:29,224 INFO L231 Difference]: Finished difference. Result has 368 places, 1504 transitions, 49415 flow [2022-12-06 05:46:29,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=49480, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=49415, PETRI_PLACES=368, PETRI_TRANSITIONS=1504} [2022-12-06 05:46:29,225 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 347 predicate places. [2022-12-06 05:46:29,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:29,225 INFO L89 Accepts]: Start accepts. Operand has 368 places, 1504 transitions, 49415 flow [2022-12-06 05:46:29,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:29,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:29,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 368 places, 1504 transitions, 49415 flow [2022-12-06 05:46:29,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 1504 transitions, 49415 flow [2022-12-06 05:46:30,428 INFO L130 PetriNetUnfolder]: 1410/4038 cut-off events. [2022-12-06 05:46:30,429 INFO L131 PetriNetUnfolder]: For 265845/267839 co-relation queries the response was YES. [2022-12-06 05:46:30,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47805 conditions, 4038 events. 1410/4038 cut-off events. For 265845/267839 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 40600 event pairs, 19 based on Foata normal form. 500/4518 useless extension candidates. Maximal degree in co-relation 47388. Up to 1392 conditions per place. [2022-12-06 05:46:30,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 1504 transitions, 49415 flow [2022-12-06 05:46:30,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 5180 [2022-12-06 05:46:30,527 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:30,527 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:30,527 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:30,528 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:30,528 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:30,528 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] L65-2-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_945| v_~q~0.base_630)) (.cse3 (* v_~q_front~0_1224 4)) (.cse2 (+ v_~q_front~0_1224 2))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_752| (+ |v_thread1Thread1of1ForFork0_~i~0#1_754| 2)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_786| 0)) (not (= (ite (and (< v_~q_front~0_1224 v_~n~0_618) (<= 0 v_~q_front~0_1224) (< v_~q_front~0_1224 v_~q_back~0_1388)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_752| (+ v_~N~0_492 1)) (not (= (ite (= (select .cse0 (+ (* v_~q_back~0_1388 4) v_~q~0.offset_630)) 1) 1 0) 0)) (= (+ 2 v_~q_back~0_1388) v_~q_back~0_1386) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_715| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_715|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749|) (= (ite (let ((.cse1 (+ v_~q_front~0_1224 1))) (and (<= 0 .cse1) (< .cse2 v_~q_back~0_1386) (< .cse1 v_~n~0_618))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_715|) (= (select .cse0 (+ .cse3 v_~q~0.offset_630 4)) |v_thread2Thread1of1ForFork1_~j~0#1_786|) (= (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1386 4) v_~q~0.offset_630)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749|) (= (+ (select .cse0 (+ .cse3 v_~q~0.offset_630)) v_~s~0_1155 |v_thread2Thread1of1ForFork1_~j~0#1_786|) v_~s~0_1154) (not (= (+ v_~s~0_1155 |v_thread2Thread1of1ForFork1_~j~0#1_786|) v_~s~0_1154)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749| 0)) (= v_~q_front~0_1223 .cse2) (not (= (ite (and (< v_~q_back~0_1386 (+ v_~n~0_618 1)) (<= 1 v_~q_back~0_1386)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1388, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_754|, #memory_int=|v_#memory_int_945|, ~N~0=v_~N~0_492, ~q~0.base=v_~q~0.base_630, ~n~0=v_~n~0_618, ~q~0.offset=v_~q~0.offset_630, ~s~0=v_~s~0_1155, ~q_front~0=v_~q_front~0_1224} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_786|, ~q_back~0=v_~q_back~0_1386, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_715|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_533|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_715|, ~N~0=v_~N~0_492, ~q~0.base=v_~q~0.base_630, ~q~0.offset=v_~q~0.offset_630, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_715|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_715|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_749|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_537|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_533|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_752|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_749|, #memory_int=|v_#memory_int_945|, ~n~0=v_~n~0_618, ~s~0=v_~s~0_1154, ~q_front~0=v_~q_front~0_1223} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:46:31,142 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,142 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,142 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,143 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,143 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,143 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:31,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:31,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2203 [2022-12-06 05:46:31,428 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 1504 transitions, 49477 flow [2022-12-06 05:46:31,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:31,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:31,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:31,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-12-06 05:46:31,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:31,631 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 576526011, now seen corresponding path program 1 times [2022-12-06 05:46:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108103551] [2022-12-06 05:46:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:32,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108103551] [2022-12-06 05:46:32,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108103551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:32,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929036650] [2022-12-06 05:46:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:32,307 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:32,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-12-06 05:46:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:32,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:46:32,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:32,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:32,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:46:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:32,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:32,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:32,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 148 [2022-12-06 05:46:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:32,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929036650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:32,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:32,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:46:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929474287] [2022-12-06 05:46:32,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:32,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:46:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:46:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:46:32,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 78 [2022-12-06 05:46:32,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1504 transitions, 49477 flow. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:32,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:32,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 78 [2022-12-06 05:46:32,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:38,480 INFO L130 PetriNetUnfolder]: 5331/9699 cut-off events. [2022-12-06 05:46:38,481 INFO L131 PetriNetUnfolder]: For 554205/554270 co-relation queries the response was YES. [2022-12-06 05:46:38,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126769 conditions, 9699 events. 5331/9699 cut-off events. For 554205/554270 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 76495 event pairs, 1094 based on Foata normal form. 53/9712 useless extension candidates. Maximal degree in co-relation 125849. Up to 9517 conditions per place. [2022-12-06 05:46:38,616 INFO L137 encePairwiseOnDemand]: 36/78 looper letters, 1426 selfloop transitions, 82 changer transitions 13/1522 dead transitions. [2022-12-06 05:46:38,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1522 transitions, 52651 flow [2022-12-06 05:46:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:46:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:46:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 05:46:38,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18269230769230768 [2022-12-06 05:46:38,617 INFO L175 Difference]: Start difference. First operand has 363 places, 1504 transitions, 49477 flow. Second operand 8 states and 114 transitions. [2022-12-06 05:46:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1522 transitions, 52651 flow [2022-12-06 05:46:44,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1522 transitions, 52519 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 05:46:44,561 INFO L231 Difference]: Finished difference. Result has 365 places, 1500 transitions, 49386 flow [2022-12-06 05:46:44,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=49338, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=49386, PETRI_PLACES=365, PETRI_TRANSITIONS=1500} [2022-12-06 05:46:44,563 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 344 predicate places. [2022-12-06 05:46:44,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:44,563 INFO L89 Accepts]: Start accepts. Operand has 365 places, 1500 transitions, 49386 flow [2022-12-06 05:46:44,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:44,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:44,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 1500 transitions, 49386 flow [2022-12-06 05:46:44,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 362 places, 1500 transitions, 49386 flow [2022-12-06 05:46:45,897 INFO L130 PetriNetUnfolder]: 1407/4017 cut-off events. [2022-12-06 05:46:45,897 INFO L131 PetriNetUnfolder]: For 267685/269722 co-relation queries the response was YES. [2022-12-06 05:46:45,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47682 conditions, 4017 events. 1407/4017 cut-off events. For 267685/269722 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 40289 event pairs, 16 based on Foata normal form. 505/4502 useless extension candidates. Maximal degree in co-relation 47260. Up to 1387 conditions per place. [2022-12-06 05:46:45,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 1500 transitions, 49386 flow [2022-12-06 05:46:45,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 5162 [2022-12-06 05:46:45,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [872] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_955| v_~q~0.base_638))) (let ((.cse1 (select .cse0 (+ (* v_~q_front~0_1251 4) v_~q~0.offset_638))) (.cse2 (+ v_~n~0_626 1))) (and (= v_~q_front~0_1249 (+ v_~q_front~0_1251 2)) (< |v_thread1Thread1of1ForFork0_~i~0#1_776| (+ v_~N~0_500 1)) (not (= (ite (and (<= 0 v_~q_front~0_1251) (< v_~q_front~0_1251 v_~n~0_626) (< v_~q_front~0_1251 v_~q_back~0_1411)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764| (ite (= (select .cse0 (+ (* v_~q_back~0_1410 4) (- 4) v_~q~0.offset_638)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_732|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764| 0)) (= v_~s~0_1182 (+ .cse1 v_~s~0_1184 |v_thread2Thread1of1ForFork1_~j~0#1_804|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764|) (not (= .cse1 0)) (= (+ 2 v_~q_back~0_1411) v_~q_back~0_1410) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732| (ite (and (<= 1 v_~q_front~0_1249) (< v_~q_front~0_1249 (+ v_~q_back~0_1410 1)) (< v_~q_front~0_1249 .cse2)) 1 0)) (not (= (ite (and (< v_~q_back~0_1410 .cse2) (<= 1 v_~q_back~0_1410)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_776| (+ |v_thread1Thread1of1ForFork0_~i~0#1_777| 2)) (not (= (ite (= 1 (select .cse0 (+ (* v_~q_back~0_1411 4) v_~q~0.offset_638))) 1 0) 0)) (= (select .cse0 (+ (- 4) v_~q~0.offset_638 (* v_~q_front~0_1249 4))) |v_thread2Thread1of1ForFork1_~j~0#1_804|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_804| 0))))) InVars {~q_back~0=v_~q_back~0_1411, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_777|, #memory_int=|v_#memory_int_955|, ~N~0=v_~N~0_500, ~q~0.base=v_~q~0.base_638, ~n~0=v_~n~0_626, ~q~0.offset=v_~q~0.offset_638, ~s~0=v_~s~0_1184, ~q_front~0=v_~q_front~0_1251} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_804|, ~q_back~0=v_~q_back~0_1410, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_732|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_548|, ~N~0=v_~N~0_500, ~q~0.base=v_~q~0.base_638, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_732|, ~q~0.offset=v_~q~0.offset_638, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_732|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_552|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_548|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_776|, #memory_int=|v_#memory_int_955|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764|, ~n~0=v_~n~0_626, ~s~0=v_~s~0_1182, ~q_front~0=v_~q_front~0_1249} 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, ~s~0, ~q_front~0] and [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:46:46,351 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,351 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,352 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,352 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,352 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,352 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [872] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_955| v_~q~0.base_638))) (let ((.cse1 (select .cse0 (+ (* v_~q_front~0_1251 4) v_~q~0.offset_638))) (.cse2 (+ v_~n~0_626 1))) (and (= v_~q_front~0_1249 (+ v_~q_front~0_1251 2)) (< |v_thread1Thread1of1ForFork0_~i~0#1_776| (+ v_~N~0_500 1)) (not (= (ite (and (<= 0 v_~q_front~0_1251) (< v_~q_front~0_1251 v_~n~0_626) (< v_~q_front~0_1251 v_~q_back~0_1411)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764| (ite (= (select .cse0 (+ (* v_~q_back~0_1410 4) (- 4) v_~q~0.offset_638)) 1) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_732|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764| 0)) (= v_~s~0_1182 (+ .cse1 v_~s~0_1184 |v_thread2Thread1of1ForFork1_~j~0#1_804|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764|) (not (= .cse1 0)) (= (+ 2 v_~q_back~0_1411) v_~q_back~0_1410) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732| (ite (and (<= 1 v_~q_front~0_1249) (< v_~q_front~0_1249 (+ v_~q_back~0_1410 1)) (< v_~q_front~0_1249 .cse2)) 1 0)) (not (= (ite (and (< v_~q_back~0_1410 .cse2) (<= 1 v_~q_back~0_1410)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_776| (+ |v_thread1Thread1of1ForFork0_~i~0#1_777| 2)) (not (= (ite (= 1 (select .cse0 (+ (* v_~q_back~0_1411 4) v_~q~0.offset_638))) 1 0) 0)) (= (select .cse0 (+ (- 4) v_~q~0.offset_638 (* v_~q_front~0_1249 4))) |v_thread2Thread1of1ForFork1_~j~0#1_804|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_804| 0))))) InVars {~q_back~0=v_~q_back~0_1411, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_777|, #memory_int=|v_#memory_int_955|, ~N~0=v_~N~0_500, ~q~0.base=v_~q~0.base_638, ~n~0=v_~n~0_626, ~q~0.offset=v_~q~0.offset_638, ~s~0=v_~s~0_1184, ~q_front~0=v_~q_front~0_1251} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_804|, ~q_back~0=v_~q_back~0_1410, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_732|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_548|, ~N~0=v_~N~0_500, ~q~0.base=v_~q~0.base_638, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_732|, ~q~0.offset=v_~q~0.offset_638, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_732|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_764|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_552|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_548|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_776|, #memory_int=|v_#memory_int_955|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_764|, ~n~0=v_~n~0_626, ~s~0=v_~s~0_1182, ~q_front~0=v_~q_front~0_1249} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:46:46,702 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,702 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,702 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,702 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,702 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:46,702 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:46:47,042 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:47,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2479 [2022-12-06 05:46:47,043 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 1500 transitions, 49456 flow [2022-12-06 05:46:47,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:47,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:47,043 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:47,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:47,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-12-06 05:46:47,249 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:47,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1177419380, now seen corresponding path program 1 times [2022-12-06 05:46:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:47,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844685557] [2022-12-06 05:46:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:48,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844685557] [2022-12-06 05:46:48,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844685557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:48,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113403556] [2022-12-06 05:46:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:48,220 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:48,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-12-06 05:46:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:48,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 05:46:48,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:48,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:46:48,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:48,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 20 [2022-12-06 05:46:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:48,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:48,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:48,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 302 treesize of output 404 [2022-12-06 05:46:48,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:48,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 172 treesize of output 205 [2022-12-06 05:46:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:50,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113403556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:50,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:50,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:46:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509382281] [2022-12-06 05:46:50,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:50,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:46:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:46:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:46:50,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 80 [2022-12-06 05:46:50,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 1500 transitions, 49456 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:50,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:50,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 80 [2022-12-06 05:46:50,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:57,558 INFO L130 PetriNetUnfolder]: 5332/9699 cut-off events. [2022-12-06 05:46:57,558 INFO L131 PetriNetUnfolder]: For 558054/558112 co-relation queries the response was YES. [2022-12-06 05:46:57,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127061 conditions, 9699 events. 5332/9699 cut-off events. For 558054/558112 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 76152 event pairs, 1218 based on Foata normal form. 40/9699 useless extension candidates. Maximal degree in co-relation 126453. Up to 9484 conditions per place. [2022-12-06 05:46:57,676 INFO L137 encePairwiseOnDemand]: 26/80 looper letters, 1437 selfloop transitions, 64 changer transitions 53/1555 dead transitions. [2022-12-06 05:46:57,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1555 transitions, 53195 flow [2022-12-06 05:46:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:46:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:46:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 164 transitions. [2022-12-06 05:46:57,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12058823529411765 [2022-12-06 05:46:57,677 INFO L175 Difference]: Start difference. First operand has 362 places, 1500 transitions, 49456 flow. Second operand 17 states and 164 transitions. [2022-12-06 05:46:57,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1555 transitions, 53195 flow [2022-12-06 05:47:02,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1555 transitions, 52969 flow, removed 35 selfloop flow, removed 5 redundant places. [2022-12-06 05:47:02,543 INFO L231 Difference]: Finished difference. Result has 379 places, 1489 transitions, 48881 flow [2022-12-06 05:47:02,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=49230, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=48881, PETRI_PLACES=379, PETRI_TRANSITIONS=1489} [2022-12-06 05:47:02,544 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 358 predicate places. [2022-12-06 05:47:02,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:02,544 INFO L89 Accepts]: Start accepts. Operand has 379 places, 1489 transitions, 48881 flow [2022-12-06 05:47:02,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:02,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:02,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 1489 transitions, 48881 flow [2022-12-06 05:47:02,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 1489 transitions, 48881 flow [2022-12-06 05:47:03,783 INFO L130 PetriNetUnfolder]: 1402/3991 cut-off events. [2022-12-06 05:47:03,784 INFO L131 PetriNetUnfolder]: For 266755/268782 co-relation queries the response was YES. [2022-12-06 05:47:03,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47511 conditions, 3991 events. 1402/3991 cut-off events. For 266755/268782 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 39786 event pairs, 15 based on Foata normal form. 497/4468 useless extension candidates. Maximal degree in co-relation 47318. Up to 1371 conditions per place. [2022-12-06 05:47:03,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 1489 transitions, 48881 flow [2022-12-06 05:47:03,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 5104 [2022-12-06 05:47:03,866 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:03,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1322 [2022-12-06 05:47:03,867 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 1489 transitions, 48881 flow [2022-12-06 05:47:03,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:03,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:03,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:03,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-12-06 05:47:04,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-12-06 05:47:04,073 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:04,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1717991127, now seen corresponding path program 1 times [2022-12-06 05:47:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:04,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233013382] [2022-12-06 05:47:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:04,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:04,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233013382] [2022-12-06 05:47:04,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233013382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:04,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493560319] [2022-12-06 05:47:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:04,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:04,932 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:04,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-12-06 05:47:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:05,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:47:05,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:05,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:05,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 05:47:05,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:05,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:47:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:05,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:05,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:05,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 243 [2022-12-06 05:47:05,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:05,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 108 [2022-12-06 05:47:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:05,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493560319] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:05,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:05,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:47:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703936315] [2022-12-06 05:47:05,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:05,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:47:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:47:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:47:05,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 05:47:05,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1489 transitions, 48881 flow. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:05,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:05,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 05:47:05,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:11,724 INFO L130 PetriNetUnfolder]: 5299/9645 cut-off events. [2022-12-06 05:47:11,725 INFO L131 PetriNetUnfolder]: For 547990/548055 co-relation queries the response was YES. [2022-12-06 05:47:11,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126035 conditions, 9645 events. 5299/9645 cut-off events. For 547990/548055 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 75605 event pairs, 1010 based on Foata normal form. 56/9661 useless extension candidates. Maximal degree in co-relation 125791. Up to 9411 conditions per place. [2022-12-06 05:47:11,866 INFO L137 encePairwiseOnDemand]: 21/74 looper letters, 1413 selfloop transitions, 84 changer transitions 28/1526 dead transitions. [2022-12-06 05:47:11,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1526 transitions, 52472 flow [2022-12-06 05:47:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:47:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:47:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-12-06 05:47:11,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15356265356265356 [2022-12-06 05:47:11,867 INFO L175 Difference]: Start difference. First operand has 368 places, 1489 transitions, 48881 flow. Second operand 11 states and 125 transitions. [2022-12-06 05:47:11,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 1526 transitions, 52472 flow [2022-12-06 05:47:16,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1526 transitions, 52336 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-06 05:47:16,932 INFO L231 Difference]: Finished difference. Result has 371 places, 1489 transitions, 48982 flow [2022-12-06 05:47:16,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=48747, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=48982, PETRI_PLACES=371, PETRI_TRANSITIONS=1489} [2022-12-06 05:47:16,934 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 350 predicate places. [2022-12-06 05:47:16,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:16,934 INFO L89 Accepts]: Start accepts. Operand has 371 places, 1489 transitions, 48982 flow [2022-12-06 05:47:16,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:16,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:16,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 1489 transitions, 48982 flow [2022-12-06 05:47:16,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 1489 transitions, 48982 flow [2022-12-06 05:47:18,284 INFO L130 PetriNetUnfolder]: 1399/3976 cut-off events. [2022-12-06 05:47:18,284 INFO L131 PetriNetUnfolder]: For 265533/267537 co-relation queries the response was YES. [2022-12-06 05:47:18,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47366 conditions, 3976 events. 1399/3976 cut-off events. For 265533/267537 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 39537 event pairs, 13 based on Foata normal form. 504/4461 useless extension candidates. Maximal degree in co-relation 47127. Up to 1370 conditions per place. [2022-12-06 05:47:18,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 1489 transitions, 48982 flow [2022-12-06 05:47:18,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 5098 [2022-12-06 05:47:18,377 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:18,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1443 [2022-12-06 05:47:18,377 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 1489 transitions, 48982 flow [2022-12-06 05:47:18,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:18,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:18,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:18,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-12-06 05:47:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-12-06 05:47:18,584 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -959563035, now seen corresponding path program 2 times [2022-12-06 05:47:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023226510] [2022-12-06 05:47:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023226510] [2022-12-06 05:47:19,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023226510] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65005064] [2022-12-06 05:47:19,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:47:19,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:19,617 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:19,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-12-06 05:47:19,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:47:19,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:47:19,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 05:47:19,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:19,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:19,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:47:20,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:20,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 05:47:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:20,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:20,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:20,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 243 [2022-12-06 05:47:20,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:20,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 108 [2022-12-06 05:47:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:20,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65005064] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:20,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:20,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:47:20,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179456758] [2022-12-06 05:47:20,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:20,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:47:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:47:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:47:20,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 05:47:20,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1489 transitions, 48982 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:20,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:20,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 05:47:20,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:26,576 INFO L130 PetriNetUnfolder]: 5277/9605 cut-off events. [2022-12-06 05:47:26,576 INFO L131 PetriNetUnfolder]: For 556712/556788 co-relation queries the response was YES. [2022-12-06 05:47:26,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125535 conditions, 9605 events. 5277/9605 cut-off events. For 556712/556788 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 75710 event pairs, 1666 based on Foata normal form. 22/9587 useless extension candidates. Maximal degree in co-relation 125054. Up to 9370 conditions per place. [2022-12-06 05:47:26,739 INFO L137 encePairwiseOnDemand]: 21/74 looper letters, 1403 selfloop transitions, 98 changer transitions 16/1518 dead transitions. [2022-12-06 05:47:26,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1518 transitions, 52444 flow [2022-12-06 05:47:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:47:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:47:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2022-12-06 05:47:26,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14742014742014742 [2022-12-06 05:47:26,740 INFO L175 Difference]: Start difference. First operand has 367 places, 1489 transitions, 48982 flow. Second operand 11 states and 120 transitions. [2022-12-06 05:47:26,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 1518 transitions, 52444 flow [2022-12-06 05:47:31,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 1518 transitions, 52221 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-12-06 05:47:31,685 INFO L231 Difference]: Finished difference. Result has 372 places, 1491 transitions, 49072 flow [2022-12-06 05:47:31,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=48759, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=49072, PETRI_PLACES=372, PETRI_TRANSITIONS=1491} [2022-12-06 05:47:31,686 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 351 predicate places. [2022-12-06 05:47:31,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:31,687 INFO L89 Accepts]: Start accepts. Operand has 372 places, 1491 transitions, 49072 flow [2022-12-06 05:47:31,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:31,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:31,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 1491 transitions, 49072 flow [2022-12-06 05:47:31,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 370 places, 1491 transitions, 49072 flow [2022-12-06 05:47:32,949 INFO L130 PetriNetUnfolder]: 1398/3980 cut-off events. [2022-12-06 05:47:32,949 INFO L131 PetriNetUnfolder]: For 262253/264241 co-relation queries the response was YES. [2022-12-06 05:47:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47278 conditions, 3980 events. 1398/3980 cut-off events. For 262253/264241 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 39841 event pairs, 15 based on Foata normal form. 490/4450 useless extension candidates. Maximal degree in co-relation 46853. Up to 1369 conditions per place. [2022-12-06 05:47:33,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 370 places, 1491 transitions, 49072 flow [2022-12-06 05:47:33,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 5102 [2022-12-06 05:47:33,026 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:33,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1342 [2022-12-06 05:47:33,028 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 1491 transitions, 49072 flow [2022-12-06 05:47:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:33,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:33,028 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:33,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:33,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:33,235 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -858817829, now seen corresponding path program 1 times [2022-12-06 05:47:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659804678] [2022-12-06 05:47:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:34,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659804678] [2022-12-06 05:47:34,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659804678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:34,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475422324] [2022-12-06 05:47:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:34,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:34,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:34,139 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:34,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-12-06 05:47:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:34,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 05:47:34,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:34,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:34,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-06 05:47:34,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:34,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:47:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:34,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:34,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:34,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 215 treesize of output 248 [2022-12-06 05:47:34,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:34,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 61 [2022-12-06 05:47:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:34,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475422324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:34,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:34,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 05:47:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003456225] [2022-12-06 05:47:34,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:34,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:47:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:47:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-12-06 05:47:34,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 74 [2022-12-06 05:47:34,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 1491 transitions, 49072 flow. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:34,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:34,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 74 [2022-12-06 05:47:34,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:41,270 INFO L130 PetriNetUnfolder]: 5314/9672 cut-off events. [2022-12-06 05:47:41,270 INFO L131 PetriNetUnfolder]: For 558940/558973 co-relation queries the response was YES. [2022-12-06 05:47:41,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126995 conditions, 9672 events. 5314/9672 cut-off events. For 558940/558973 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 75711 event pairs, 977 based on Foata normal form. 35/9667 useless extension candidates. Maximal degree in co-relation 126384. Up to 9319 conditions per place. [2022-12-06 05:47:41,383 INFO L137 encePairwiseOnDemand]: 25/74 looper letters, 1433 selfloop transitions, 91 changer transitions 44/1569 dead transitions. [2022-12-06 05:47:41,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1569 transitions, 53574 flow [2022-12-06 05:47:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:47:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:47:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 180 transitions. [2022-12-06 05:47:41,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12802275960170698 [2022-12-06 05:47:41,385 INFO L175 Difference]: Start difference. First operand has 370 places, 1491 transitions, 49072 flow. Second operand 19 states and 180 transitions. [2022-12-06 05:47:41,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 1569 transitions, 53574 flow [2022-12-06 05:47:46,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 1569 transitions, 53421 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-06 05:47:46,485 INFO L231 Difference]: Finished difference. Result has 390 places, 1494 transitions, 49405 flow [2022-12-06 05:47:46,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=48919, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=49405, PETRI_PLACES=390, PETRI_TRANSITIONS=1494} [2022-12-06 05:47:46,486 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 369 predicate places. [2022-12-06 05:47:46,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:46,486 INFO L89 Accepts]: Start accepts. Operand has 390 places, 1494 transitions, 49405 flow [2022-12-06 05:47:46,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:46,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:46,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 390 places, 1494 transitions, 49405 flow [2022-12-06 05:47:46,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 384 places, 1494 transitions, 49405 flow [2022-12-06 05:47:47,696 INFO L130 PetriNetUnfolder]: 1396/3963 cut-off events. [2022-12-06 05:47:47,696 INFO L131 PetriNetUnfolder]: For 269321/271296 co-relation queries the response was YES. [2022-12-06 05:47:47,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47673 conditions, 3963 events. 1396/3963 cut-off events. For 269321/271296 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 39316 event pairs, 16 based on Foata normal form. 488/4431 useless extension candidates. Maximal degree in co-relation 47506. Up to 1369 conditions per place. [2022-12-06 05:47:47,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 1494 transitions, 49405 flow [2022-12-06 05:47:47,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 5088 [2022-12-06 05:47:47,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:47:47,913 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:47,913 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:48,181 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:48,181 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:47:48,279 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:48,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1794 [2022-12-06 05:47:48,281 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1493 transitions, 49391 flow [2022-12-06 05:47:48,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:48,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:48,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:48,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:48,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2022-12-06 05:47:48,483 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:48,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash 160525877, now seen corresponding path program 1 times [2022-12-06 05:47:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:48,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103862478] [2022-12-06 05:47:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:49,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103862478] [2022-12-06 05:47:49,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103862478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:49,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880224850] [2022-12-06 05:47:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:49,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:49,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:49,277 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:49,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-12-06 05:47:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:49,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:47:49,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:49,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:49,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:47:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:47:49,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:47:49,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880224850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:49,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:47:49,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-12-06 05:47:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211640290] [2022-12-06 05:47:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:49,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:47:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:47:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:47:49,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 05:47:49,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1493 transitions, 49391 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:47:49,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:49,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 05:47:49,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:55,520 INFO L130 PetriNetUnfolder]: 5213/9439 cut-off events. [2022-12-06 05:47:55,520 INFO L131 PetriNetUnfolder]: For 549277/549346 co-relation queries the response was YES. [2022-12-06 05:47:55,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124169 conditions, 9439 events. 5213/9439 cut-off events. For 549277/549346 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 72790 event pairs, 333 based on Foata normal form. 73/9472 useless extension candidates. Maximal degree in co-relation 123985. Up to 7992 conditions per place. [2022-12-06 05:47:55,685 INFO L137 encePairwiseOnDemand]: 17/77 looper letters, 1221 selfloop transitions, 301 changer transitions 1/1524 dead transitions. [2022-12-06 05:47:55,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1524 transitions, 53107 flow [2022-12-06 05:47:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 05:47:55,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2922077922077922 [2022-12-06 05:47:55,686 INFO L175 Difference]: Start difference. First operand has 383 places, 1493 transitions, 49391 flow. Second operand 4 states and 90 transitions. [2022-12-06 05:47:55,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1524 transitions, 53107 flow [2022-12-06 05:48:00,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1524 transitions, 52721 flow, removed 176 selfloop flow, removed 7 redundant places. [2022-12-06 05:48:00,901 INFO L231 Difference]: Finished difference. Result has 380 places, 1494 transitions, 49936 flow [2022-12-06 05:48:00,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=48937, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=297, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=49936, PETRI_PLACES=380, PETRI_TRANSITIONS=1494} [2022-12-06 05:48:00,902 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 359 predicate places. [2022-12-06 05:48:00,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:00,902 INFO L89 Accepts]: Start accepts. Operand has 380 places, 1494 transitions, 49936 flow [2022-12-06 05:48:00,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:00,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:00,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 380 places, 1494 transitions, 49936 flow [2022-12-06 05:48:00,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 379 places, 1494 transitions, 49936 flow [2022-12-06 05:48:02,456 INFO L130 PetriNetUnfolder]: 1392/3934 cut-off events. [2022-12-06 05:48:02,456 INFO L131 PetriNetUnfolder]: For 266287/268201 co-relation queries the response was YES. [2022-12-06 05:48:02,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47254 conditions, 3934 events. 1392/3934 cut-off events. For 266287/268201 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 38872 event pairs, 14 based on Foata normal form. 487/4402 useless extension candidates. Maximal degree in co-relation 46836. Up to 1345 conditions per place. [2022-12-06 05:48:02,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 1494 transitions, 49936 flow [2022-12-06 05:48:02,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 5084 [2022-12-06 05:48:02,542 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:48:02,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1640 [2022-12-06 05:48:02,542 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 1494 transitions, 49936 flow [2022-12-06 05:48:02,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 05:48:02,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:02,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:02,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:02,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-12-06 05:48:02,749 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1678299179, now seen corresponding path program 1 times [2022-12-06 05:48:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:02,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378318432] [2022-12-06 05:48:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378318432] [2022-12-06 05:48:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378318432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188818253] [2022-12-06 05:48:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:03,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:03,601 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:03,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-12-06 05:48:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:03,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:48:03,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:03,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:03,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-06 05:48:04,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:04,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 05:48:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:04,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:04,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:04,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 226 [2022-12-06 05:48:04,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:04,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 73 [2022-12-06 05:48:04,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:04,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 53 [2022-12-06 05:48:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:04,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188818253] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:04,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:04,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:48:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724397736] [2022-12-06 05:48:04,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:04,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:48:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:04,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:48:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:48:04,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 77 [2022-12-06 05:48:04,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 1494 transitions, 49936 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:04,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:04,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 77 [2022-12-06 05:48:04,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:10,413 INFO L130 PetriNetUnfolder]: 5221/9461 cut-off events. [2022-12-06 05:48:10,413 INFO L131 PetriNetUnfolder]: For 558794/558830 co-relation queries the response was YES. [2022-12-06 05:48:10,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124980 conditions, 9461 events. 5221/9461 cut-off events. For 558794/558830 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 73711 event pairs, 1022 based on Foata normal form. 37/9458 useless extension candidates. Maximal degree in co-relation 124245. Up to 9280 conditions per place. [2022-12-06 05:48:10,532 INFO L137 encePairwiseOnDemand]: 36/77 looper letters, 1438 selfloop transitions, 80 changer transitions 11/1530 dead transitions. [2022-12-06 05:48:10,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1530 transitions, 53285 flow [2022-12-06 05:48:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:48:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:48:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 149 transitions. [2022-12-06 05:48:10,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13821892393320964 [2022-12-06 05:48:10,533 INFO L175 Difference]: Start difference. First operand has 379 places, 1494 transitions, 49936 flow. Second operand 14 states and 149 transitions. [2022-12-06 05:48:10,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1530 transitions, 53285 flow [2022-12-06 05:48:16,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1530 transitions, 52977 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:48:16,085 INFO L231 Difference]: Finished difference. Result has 393 places, 1494 transitions, 49789 flow [2022-12-06 05:48:16,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=49628, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=49789, PETRI_PLACES=393, PETRI_TRANSITIONS=1494} [2022-12-06 05:48:16,086 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 372 predicate places. [2022-12-06 05:48:16,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:16,086 INFO L89 Accepts]: Start accepts. Operand has 393 places, 1494 transitions, 49789 flow [2022-12-06 05:48:16,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:16,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:16,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 1494 transitions, 49789 flow [2022-12-06 05:48:16,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 1494 transitions, 49789 flow [2022-12-06 05:48:17,336 INFO L130 PetriNetUnfolder]: 1391/3933 cut-off events. [2022-12-06 05:48:17,336 INFO L131 PetriNetUnfolder]: For 266461/268308 co-relation queries the response was YES. [2022-12-06 05:48:17,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47171 conditions, 3933 events. 1391/3933 cut-off events. For 266461/268308 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 38956 event pairs, 14 based on Foata normal form. 488/4401 useless extension candidates. Maximal degree in co-relation 46913. Up to 1344 conditions per place. [2022-12-06 05:48:17,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 391 places, 1494 transitions, 49789 flow [2022-12-06 05:48:17,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 5084 [2022-12-06 05:48:17,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [926] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1046| v_~q~0.base_707))) (and (not (= (ite (and (< v_~q_front~0_1474 v_~n~0_694) (<= 0 v_~q_front~0_1474) (< v_~q_front~0_1474 v_~q_back~0_1587)) 1 0) 0)) (= (+ v_~q_front~0_1474 2) v_~q_front~0_1472) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_878| (ite (and (<= 1 v_~q_front~0_1472) (< v_~q_front~0_1472 (+ v_~n~0_694 1)) (< v_~q_front~0_1472 (+ v_~q_back~0_1587 1))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_878| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_878|) (not (= v_~s~0_1413 (+ v_~s~0_1415 |v_thread2Thread1of1ForFork1_~j~0#1_960|))) (= (select .cse0 (+ (* v_~q_front~0_1472 4) (- 4) v_~q~0.offset_707)) |v_thread2Thread1of1ForFork1_~j~0#1_960|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_960| 0)) (= (+ (select .cse0 (+ v_~q~0.offset_707 (* v_~q_front~0_1474 4))) v_~s~0_1415 |v_thread2Thread1of1ForFork1_~j~0#1_960|) v_~s~0_1413) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_878| 0)))) InVars {~q_back~0=v_~q_back~0_1587, #memory_int=|v_#memory_int_1046|, ~q~0.base=v_~q~0.base_707, ~n~0=v_~n~0_694, ~q~0.offset=v_~q~0.offset_707, ~s~0=v_~s~0_1415, ~q_front~0=v_~q_front~0_1474} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_878|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_960|, ~q_back~0=v_~q_back~0_1587, #memory_int=|v_#memory_int_1046|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_878|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_878|, ~q~0.base=v_~q~0.base_707, ~n~0=v_~n~0_694, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_878|, ~q~0.offset=v_~q~0.offset_707, ~s~0=v_~s~0_1413, ~q_front~0=v_~q_front~0_1472} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:48:17,561 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:17,562 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:17,718 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:17,718 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:18,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [901] $Ultimate##0-->L65-2: Formula: (let ((.cse1 (select |v_#memory_int_1002| v_~q~0.base_675)) (.cse4 (* v_~q_front~0_1363 4))) (let ((.cse0 (select .cse1 (+ .cse4 v_~q~0.offset_675))) (.cse2 (* v_~q_back~0_1482 4))) (and (not (= .cse0 0)) (= (ite (= (select .cse1 (+ 8 v_~q~0.offset_675 .cse2)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_797|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_805| 0)) (= (+ 3 v_~q_back~0_1482) v_~q_back~0_1481) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_880| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_797| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_797|) (not (= (ite (let ((.cse3 (+ 2 v_~q_back~0_1482))) (and (<= 0 .cse3) (< .cse3 v_~n~0_662))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_805| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_805|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_797| 0)) (= (select .cse1 (+ .cse4 v_~q~0.offset_675 4)) |v_thread2Thread1of1ForFork1_~j~0#1_880|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_805| (ite (let ((.cse5 (+ v_~q_front~0_1363 1))) (and (< .cse5 v_~q_back~0_1481) (< .cse5 v_~n~0_662) (<= 0 .cse5))) 1 0)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_675 4 .cse2)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_front~0_1363 v_~q_back~0_1481) (<= 0 v_~q_front~0_1363) (< v_~q_front~0_1363 v_~n~0_662)) 1 0) 0)) (= (+ .cse0 v_~s~0_1293 |v_thread2Thread1of1ForFork1_~j~0#1_880|) v_~s~0_1291) (= |v_thread1Thread1of1ForFork0_~i~0#1_813| 3) (< |v_thread1Thread1of1ForFork0_~i~0#1_813| (+ v_~N~0_520 1)) (not (= (ite (and (<= 0 v_~q_back~0_1482) (< v_~q_back~0_1482 v_~n~0_662)) 1 0) 0)) (= v_~q_front~0_1361 (+ v_~q_front~0_1363 2)) (not (= (ite (= (select .cse1 (+ v_~q~0.offset_675 .cse2)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1482, #memory_int=|v_#memory_int_1002|, ~N~0=v_~N~0_520, ~q~0.base=v_~q~0.base_675, ~n~0=v_~n~0_662, ~q~0.offset=v_~q~0.offset_675, ~s~0=v_~s~0_1293, ~q_front~0=v_~q_front~0_1363} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_880|, ~q_back~0=v_~q_back~0_1481, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_805|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_805|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_577|, ~N~0=v_~N~0_520, ~q~0.base=v_~q~0.base_675, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_805|, ~q~0.offset=v_~q~0.offset_675, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_805|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_797|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_581|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_577|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_813|, #memory_int=|v_#memory_int_1002|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_797|, ~n~0=v_~n~0_662, ~s~0=v_~s~0_1291, ~q_front~0=v_~q_front~0_1361} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:48:18,473 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:18,473 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:18,473 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:18,473 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:18,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [904] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1006| v_~q~0.base_679)) (.cse1 (* v_~q_back~0_1493 4)) (.cse2 (+ 3 v_~q_back~0_1493))) (and (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_679 4)) 1) 1 0) 0)) (= v_~q_front~0_1371 (+ v_~q_front~0_1372 1)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_679)) 1) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_803| 0)) (= (+ v_~q_back~0_1493 4) v_~q_back~0_1491) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_679)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_811| (ite (and (< v_~q_front~0_1372 v_~n~0_666) (< v_~q_front~0_1372 .cse2) (<= 0 v_~q_front~0_1372)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_811| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_811|) (= (select .cse0 (+ v_~q~0.offset_679 (* v_~q_front~0_1372 4))) |v_thread2Thread1of1ForFork1_~j~0#1_886|) (< 3 v_~N~0_524) (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_679)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_803|) (not (= (ite (and (<= 0 v_~q_back~0_1493) (< v_~q_back~0_1493 v_~n~0_666)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_886| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_811| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_803| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_803|) (= |v_thread1Thread1of1ForFork0_~i~0#1_817| 4) (= (+ v_~s~0_1302 |v_thread2Thread1of1ForFork1_~j~0#1_886|) v_~s~0_1301) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~n~0_666)) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1493, #memory_int=|v_#memory_int_1006|, ~N~0=v_~N~0_524, ~q~0.base=v_~q~0.base_679, ~n~0=v_~n~0_666, ~q~0.offset=v_~q~0.offset_679, ~s~0=v_~s~0_1302, ~q_front~0=v_~q_front~0_1372} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_886|, ~q_back~0=v_~q_back~0_1491, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_811|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_581|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_811|, ~N~0=v_~N~0_524, ~q~0.base=v_~q~0.base_679, ~q~0.offset=v_~q~0.offset_679, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_811|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_811|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_803|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_585|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_581|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_817|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_803|, #memory_int=|v_#memory_int_1006|, ~n~0=v_~n~0_666, ~s~0=v_~s~0_1301, ~q_front~0=v_~q_front~0_1371} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:48:19,407 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:48:19,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3322 [2022-12-06 05:48:19,408 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 1494 transitions, 49995 flow [2022-12-06 05:48:19,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:19,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:19,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:19,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:19,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-12-06 05:48:19,614 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 872536494, now seen corresponding path program 1 times [2022-12-06 05:48:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:19,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459015004] [2022-12-06 05:48:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459015004] [2022-12-06 05:48:20,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459015004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678043264] [2022-12-06 05:48:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:20,024 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:20,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-12-06 05:48:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:20,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 05:48:20,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:48:20,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-06 05:48:20,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:20,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:48:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:20,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:20,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:20,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 226 [2022-12-06 05:48:20,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:20,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 73 [2022-12-06 05:48:20,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:48:20,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 53 [2022-12-06 05:48:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678043264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:20,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:48:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653044005] [2022-12-06 05:48:20,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:20,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:48:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:48:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:48:20,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 83 [2022-12-06 05:48:20,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 1494 transitions, 49995 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:20,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:20,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 83 [2022-12-06 05:48:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:25,886 INFO L130 PetriNetUnfolder]: 5212/9453 cut-off events. [2022-12-06 05:48:25,887 INFO L131 PetriNetUnfolder]: For 565851/565921 co-relation queries the response was YES. [2022-12-06 05:48:25,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124599 conditions, 9453 events. 5212/9453 cut-off events. For 565851/565921 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 73970 event pairs, 1657 based on Foata normal form. 54/9467 useless extension candidates. Maximal degree in co-relation 124377. Up to 9313 conditions per place. [2022-12-06 05:48:26,018 INFO L137 encePairwiseOnDemand]: 41/83 looper letters, 1444 selfloop transitions, 57 changer transitions 8/1510 dead transitions. [2022-12-06 05:48:26,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1510 transitions, 53142 flow [2022-12-06 05:48:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:48:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:48:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-06 05:48:26,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19793459552495696 [2022-12-06 05:48:26,019 INFO L175 Difference]: Start difference. First operand has 391 places, 1494 transitions, 49995 flow. Second operand 7 states and 115 transitions. [2022-12-06 05:48:26,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1510 transitions, 53142 flow [2022-12-06 05:48:31,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 1510 transitions, 52759 flow, removed 66 selfloop flow, removed 10 redundant places. [2022-12-06 05:48:31,320 INFO L231 Difference]: Finished difference. Result has 388 places, 1491 transitions, 49606 flow [2022-12-06 05:48:31,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=49612, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=49606, PETRI_PLACES=388, PETRI_TRANSITIONS=1491} [2022-12-06 05:48:31,321 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 367 predicate places. [2022-12-06 05:48:31,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:31,321 INFO L89 Accepts]: Start accepts. Operand has 388 places, 1491 transitions, 49606 flow [2022-12-06 05:48:31,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:31,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:31,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 1491 transitions, 49606 flow [2022-12-06 05:48:31,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 1491 transitions, 49606 flow [2022-12-06 05:48:32,449 INFO L130 PetriNetUnfolder]: 1390/3934 cut-off events. [2022-12-06 05:48:32,449 INFO L131 PetriNetUnfolder]: For 264515/266423 co-relation queries the response was YES. [2022-12-06 05:48:32,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47043 conditions, 3934 events. 1390/3934 cut-off events. For 264515/266423 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 39148 event pairs, 18 based on Foata normal form. 457/4373 useless extension candidates. Maximal degree in co-relation 46880. Up to 1344 conditions per place. [2022-12-06 05:48:32,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 1491 transitions, 49606 flow [2022-12-06 05:48:32,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 5078 [2022-12-06 05:48:32,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [908] L65-2-->L65-2: Formula: (let ((.cse0 (select |v_#memory_int_1012| v_~q~0.base_683)) (.cse1 (* v_~q_front~0_1386 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_819| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_819|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_832| 1) |v_thread1Thread1of1ForFork0_~i~0#1_831|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_815| 0)) (= (select .cse0 (+ v_~q~0.offset_683 4 .cse1)) |v_thread2Thread1of1ForFork1_~j~0#1_895|) (not (= (+ v_~s~0_1317 |v_thread2Thread1of1ForFork1_~j~0#1_895|) v_~s~0_1315)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_819| (ite (let ((.cse2 (+ v_~q_front~0_1386 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_670) (< .cse2 v_~q_back~0_1507))) 1 0)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1508 4) v_~q~0.offset_683)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_815|) (< |v_thread1Thread1of1ForFork0_~i~0#1_832| v_~N~0_528) (= (+ v_~q_back~0_1508 1) v_~q_back~0_1507) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_815| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_815|) (= v_~s~0_1315 (+ v_~s~0_1317 |v_thread2Thread1of1ForFork1_~j~0#1_895| (select .cse0 (+ v_~q~0.offset_683 .cse1)))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_895| 0)) (not (= (ite (and (<= 0 v_~q_back~0_1508) (< v_~q_back~0_1508 v_~n~0_670)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_front~0_1386) (< v_~q_front~0_1386 v_~q_back~0_1508) (< v_~q_front~0_1386 v_~n~0_670)) 1 0) 0)) (= v_~q_front~0_1384 (+ v_~q_front~0_1386 2)))) InVars {~q_back~0=v_~q_back~0_1508, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_832|, #memory_int=|v_#memory_int_1012|, ~N~0=v_~N~0_528, ~q~0.base=v_~q~0.base_683, ~n~0=v_~n~0_670, ~q~0.offset=v_~q~0.offset_683, ~s~0=v_~s~0_1317, ~q_front~0=v_~q_front~0_1386} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_895|, ~q_back~0=v_~q_back~0_1507, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_819|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_819|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_592|, ~N~0=v_~N~0_528, ~q~0.base=v_~q~0.base_683, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_819|, ~q~0.offset=v_~q~0.offset_683, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_819|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_815|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_596|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_592|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_831|, #memory_int=|v_#memory_int_1012|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_815|, ~n~0=v_~n~0_670, ~s~0=v_~s~0_1315, ~q_front~0=v_~q_front~0_1384} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:48:32,846 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:32,846 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:33,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:33,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1732 [2022-12-06 05:48:33,053 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 1491 transitions, 49654 flow [2022-12-06 05:48:33,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:33,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:33,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:33,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:33,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:33,254 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash 48247460, now seen corresponding path program 1 times [2022-12-06 05:48:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:33,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683564532] [2022-12-06 05:48:33,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:33,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683564532] [2022-12-06 05:48:33,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683564532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597126329] [2022-12-06 05:48:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:33,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:33,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:33,556 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:33,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-12-06 05:48:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:33,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:48:33,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:33,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:33,975 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:48:33,976 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 26 treesize of output 18 [2022-12-06 05:48:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:34,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597126329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:34,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:34,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-12-06 05:48:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592526787] [2022-12-06 05:48:34,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:34,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:48:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:34,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:48:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:48:34,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 83 [2022-12-06 05:48:34,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1491 transitions, 49654 flow. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:34,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:34,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 83 [2022-12-06 05:48:34,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:39,862 INFO L130 PetriNetUnfolder]: 5425/9817 cut-off events. [2022-12-06 05:48:39,862 INFO L131 PetriNetUnfolder]: For 637415/637467 co-relation queries the response was YES. [2022-12-06 05:48:39,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129875 conditions, 9817 events. 5425/9817 cut-off events. For 637415/637467 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 76722 event pairs, 930 based on Foata normal form. 134/9911 useless extension candidates. Maximal degree in co-relation 129697. Up to 8132 conditions per place. [2022-12-06 05:48:40,003 INFO L137 encePairwiseOnDemand]: 37/83 looper letters, 1324 selfloop transitions, 364 changer transitions 3/1692 dead transitions. [2022-12-06 05:48:40,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1692 transitions, 58053 flow [2022-12-06 05:48:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:48:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:48:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 195 transitions. [2022-12-06 05:48:40,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13052208835341367 [2022-12-06 05:48:40,004 INFO L175 Difference]: Start difference. First operand has 385 places, 1491 transitions, 49654 flow. Second operand 18 states and 195 transitions. [2022-12-06 05:48:40,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 1692 transitions, 58053 flow [2022-12-06 05:48:45,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1692 transitions, 57901 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-06 05:48:45,412 INFO L231 Difference]: Finished difference. Result has 402 places, 1544 transitions, 52878 flow [2022-12-06 05:48:45,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=49499, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=52878, PETRI_PLACES=402, PETRI_TRANSITIONS=1544} [2022-12-06 05:48:45,413 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 381 predicate places. [2022-12-06 05:48:45,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:45,413 INFO L89 Accepts]: Start accepts. Operand has 402 places, 1544 transitions, 52878 flow [2022-12-06 05:48:45,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:45,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:45,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 1544 transitions, 52878 flow [2022-12-06 05:48:45,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 1544 transitions, 52878 flow [2022-12-06 05:48:46,752 INFO L130 PetriNetUnfolder]: 1449/4078 cut-off events. [2022-12-06 05:48:46,753 INFO L131 PetriNetUnfolder]: For 289750/291676 co-relation queries the response was YES. [2022-12-06 05:48:46,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49944 conditions, 4078 events. 1449/4078 cut-off events. For 289750/291676 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 40551 event pairs, 13 based on Foata normal form. 488/4548 useless extension candidates. Maximal degree in co-relation 49525. Up to 1416 conditions per place. [2022-12-06 05:48:46,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 401 places, 1544 transitions, 52878 flow [2022-12-06 05:48:46,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 5298 [2022-12-06 05:48:46,830 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:46,830 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:46,830 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:46,830 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] $Ultimate##0-->L93-3: Formula: (let ((.cse0 (select |v_#memory_int_972| v_~q~0.base_650)) (.cse1 (* v_~q_back~0_1431 4))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_773| 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_650)) 1) 1 0) 0)) (= (store |v_#memory_int_972| |v_ULTIMATE.start_main_~#t2~0#1.base_177| (store (select |v_#memory_int_972| |v_ULTIMATE.start_main_~#t2~0#1.base_177|) |v_ULTIMATE.start_main_~#t2~0#1.offset_174| |v_ULTIMATE.start_main_#t~pre14#1_306|)) |v_#memory_int_971|) (= |v_thread1Thread1of1ForFork0_~i~0#1_786| 3) (not (= (ite (let ((.cse2 (+ 2 v_~q_back~0_1431))) (and (<= 0 .cse2) (< .cse2 v_~n~0_638))) 1 0) 0)) (= |v_#pthreadsForks_374| (+ |v_#pthreadsForks_375| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_773| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_773|) (not (= (ite (and (< v_~q_back~0_1431 v_~n~0_638) (<= 0 v_~q_back~0_1431)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_650 4)) 1) 1 0) 0)) (= (+ 3 v_~q_back~0_1431) v_~q_back~0_1430) (= |v_ULTIMATE.start_main_#t~pre14#1_306| |v_#pthreadsForks_375|) (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_650)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_773|) (< 2 v_~N~0_506))) InVars {#pthreadsForks=|v_#pthreadsForks_375|, ~q_back~0=v_~q_back~0_1431, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_174|, #memory_int=|v_#memory_int_972|, ~N~0=v_~N~0_506, ~q~0.base=v_~q~0.base_650, ~n~0=v_~n~0_638, ~q~0.offset=v_~q~0.offset_650, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_177|} OutVars{~q_back~0=v_~q_back~0_1430, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_174|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_556|, ~N~0=v_~N~0_506, ~q~0.base=v_~q~0.base_650, ~q~0.offset=v_~q~0.offset_650, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_277|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_773|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_306|, #pthreadsForks=|v_#pthreadsForks_374|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_560|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_556|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_786|, #memory_int=|v_#memory_int_971|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_233|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_773|, ~n~0=v_~n~0_638, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_177|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:48:47,101 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,101 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,101 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,101 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,376 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,376 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,534 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,534 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:47,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [946] L65-2-->L65-2: Formula: (let ((.cse3 (select |v_#memory_int_1080| v_~q~0.base_731)) (.cse4 (* v_~q_front~0_1539 4))) (let ((.cse1 (select .cse3 (+ .cse4 v_~q~0.offset_731 4))) (.cse0 (select .cse3 (+ .cse4 v_~q~0.offset_731)))) (and (not (= .cse0 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_921| 0)) (not (= .cse1 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1006| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_921| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_921|) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1006| .cse1 .cse0 v_~s~0_1480) v_~s~0_1478) (= v_~q_front~0_1537 (+ v_~q_front~0_1539 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_921| (ite (let ((.cse2 (+ v_~q_front~0_1539 2))) (and (<= 0 .cse2) (< .cse2 v_~n~0_718) (< .cse2 v_~q_back~0_1648))) 1 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1006| (select .cse3 (+ .cse4 8 v_~q~0.offset_731))) (not (= (ite (and (< v_~q_front~0_1539 v_~q_back~0_1648) (<= 0 v_~q_front~0_1539) (< v_~q_front~0_1539 v_~n~0_718)) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1648, #memory_int=|v_#memory_int_1080|, ~q~0.base=v_~q~0.base_731, ~n~0=v_~n~0_718, ~q~0.offset=v_~q~0.offset_731, ~s~0=v_~s~0_1480, ~q_front~0=v_~q_front~0_1539} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_921|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1006|, ~q_back~0=v_~q_back~0_1648, #memory_int=|v_#memory_int_1080|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_921|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_921|, ~q~0.base=v_~q~0.base_731, ~n~0=v_~n~0_718, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_921|, ~q~0.offset=v_~q~0.offset_731, ~s~0=v_~s~0_1478, ~q_front~0=v_~q_front~0_1537} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:48:47,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [948] L65-2-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_1082| v_~q~0.base_733)) (.cse2 (* v_~q_front~0_1545 4))) (let ((.cse0 (select .cse1 (+ .cse2 v_~q~0.offset_733)))) (and (= (+ .cse0 |v_thread2Thread1of1ForFork1_~j~0#1_1010| v_~s~0_1486) v_~s~0_1484) (= |v_thread2Thread1of1ForFork1_~j~0#1_1010| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_209| 0) (= (+ v_~q_front~0_1545 2) v_~q_front~0_1543) (= |v_thread2Thread1of1ForFork1_~j~0#1_1010| (select .cse1 (+ .cse2 v_~q~0.offset_733 4))) (not (= .cse0 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_925| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_925| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_925|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_925| (ite (let ((.cse3 (+ v_~q_front~0_1545 1))) (and (<= 0 .cse3) (< .cse3 v_~q_back~0_1650) (< .cse3 v_~n~0_720))) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1545) (< v_~q_front~0_1545 v_~n~0_720) (< v_~q_front~0_1545 v_~q_back~0_1650)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_209| 0)))) InVars {~q_back~0=v_~q_back~0_1650, #memory_int=|v_#memory_int_1082|, ~q~0.base=v_~q~0.base_733, ~n~0=v_~n~0_720, ~q~0.offset=v_~q~0.offset_733, ~s~0=v_~s~0_1486, ~q_front~0=v_~q_front~0_1545} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1010|, ~q_back~0=v_~q_back~0_1650, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_209|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_925|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_925|, ~q~0.base=v_~q~0.base_733, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_925|, ~q~0.offset=v_~q~0.offset_733, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_925|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_209|, #memory_int=|v_#memory_int_1082|, ~n~0=v_~n~0_720, ~s~0=v_~s~0_1484, ~q_front~0=v_~q_front~0_1543} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:48:48,107 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,107 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,107 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,108 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [929] L65-2-->L47-4: Formula: (let ((.cse0 (+ v_~q_back~0_1595 1)) (.cse1 (select |v_#memory_int_1053| v_~q~0.base_711))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_890| (ite (and (<= 1 v_~q_front~0_1490) (< v_~q_front~0_1490 .cse0) (< v_~q_front~0_1490 (+ v_~n~0_698 1))) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_906| v_~N~0_552) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_890| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_890|) (= |v_thread2Thread1of1ForFork1_~j~0#1_973| (select .cse1 (+ (* v_~q_front~0_1490 4) (- 4) v_~q~0.offset_711))) (= .cse0 v_~q_back~0_1594) (not (= 0 (ite (and (<= 0 v_~q_back~0_1595) (< v_~q_back~0_1595 v_~n~0_698)) 1 0))) (= (+ v_~q_front~0_1491 2) v_~q_front~0_1490) (not (= (ite (and (< v_~q_front~0_1491 v_~q_back~0_1595) (<= 0 v_~q_front~0_1491) (< v_~q_front~0_1491 v_~n~0_698)) 1 0) 0)) (= (ite (= (select .cse1 (+ v_~q~0.offset_711 (* v_~q_back~0_1595 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_875|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_875| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_875|) (= v_~s~0_1431 (+ (select .cse1 (+ (* v_~q_front~0_1491 4) v_~q~0.offset_711)) v_~s~0_1432 |v_thread2Thread1of1ForFork1_~j~0#1_973|)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_973| 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_906| 1) |v_thread1Thread1of1ForFork0_~i~0#1_905|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_875| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_890| 0)) (not (= (+ v_~s~0_1432 |v_thread2Thread1of1ForFork1_~j~0#1_973|) v_~s~0_1431)))) InVars {~q_back~0=v_~q_back~0_1595, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_906|, #memory_int=|v_#memory_int_1053|, ~N~0=v_~N~0_552, ~q~0.base=v_~q~0.base_711, ~n~0=v_~n~0_698, ~q~0.offset=v_~q~0.offset_711, ~s~0=v_~s~0_1432, ~q_front~0=v_~q_front~0_1491} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_973|, ~q_back~0=v_~q_back~0_1594, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_890|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_639|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_890|, ~N~0=v_~N~0_552, ~q~0.base=v_~q~0.base_711, ~q~0.offset=v_~q~0.offset_711, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_890|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_890|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_875|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_643|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_639|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_905|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_875|, #memory_int=|v_#memory_int_1053|, ~n~0=v_~n~0_698, ~s~0=v_~s~0_1431, ~q_front~0=v_~q_front~0_1490} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:48:48,259 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,259 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,259 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,259 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,259 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,259 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:48:48,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1088| v_~q~0.base_739)) (.cse1 (* v_~q_back~0_1662 4))) (and (not (= (ite (= (select .cse0 (+ v_~q~0.offset_739 .cse1)) 1) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1662 v_~n~0_726) (<= 0 v_~q_back~0_1662)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_948| (+ v_~N~0_574 1)) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_739 4 .cse1)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ 3 v_~q_back~0_1662))) (and (< .cse2 v_~n~0_726) (<= 0 .cse2))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_914| 0)) (= (+ v_~q_back~0_1662 4) v_~q_back~0_1660) (= |v_thread1Thread1of1ForFork0_~i~0#1_948| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_914| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_914|) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_739 .cse1)) 1) 1 0) 0)) (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_739 .cse1)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_914|))) InVars {~q_back~0=v_~q_back~0_1662, #memory_int=|v_#memory_int_1088|, ~N~0=v_~N~0_574, ~q~0.base=v_~q~0.base_739, ~n~0=v_~n~0_726, ~q~0.offset=v_~q~0.offset_739} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_914|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_676|, ~q_back~0=v_~q_back~0_1660, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_672|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_948|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_914|, #memory_int=|v_#memory_int_1088|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_672|, ~N~0=v_~N~0_574, ~q~0.base=v_~q~0.base_739, ~n~0=v_~n~0_726, ~q~0.offset=v_~q~0.offset_739} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:48:48,645 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:48:48,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3232 [2022-12-06 05:48:48,645 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 1541 transitions, 53032 flow [2022-12-06 05:48:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:48,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:48,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:48,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:48,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:48,851 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 867979091, now seen corresponding path program 1 times [2022-12-06 05:48:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:48,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859258166] [2022-12-06 05:48:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859258166] [2022-12-06 05:48:49,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859258166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596841913] [2022-12-06 05:48:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:49,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:49,108 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:48:49,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-12-06 05:48:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:49,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:48:49,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:49,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:49,466 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:48:49,466 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 25 treesize of output 16 [2022-12-06 05:48:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:49,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596841913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:49,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:49,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-06 05:48:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499734350] [2022-12-06 05:48:49,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:49,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:48:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:48:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:48:49,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 87 [2022-12-06 05:48:49,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1541 transitions, 53032 flow. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:49,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:49,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 87 [2022-12-06 05:48:49,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:55,179 INFO L130 PetriNetUnfolder]: 5467/9879 cut-off events. [2022-12-06 05:48:55,179 INFO L131 PetriNetUnfolder]: For 641268/641448 co-relation queries the response was YES. [2022-12-06 05:48:55,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133649 conditions, 9879 events. 5467/9879 cut-off events. For 641268/641448 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 77118 event pairs, 942 based on Foata normal form. 85/9924 useless extension candidates. Maximal degree in co-relation 132624. Up to 8844 conditions per place. [2022-12-06 05:48:55,300 INFO L137 encePairwiseOnDemand]: 34/87 looper letters, 1348 selfloop transitions, 286 changer transitions 0/1635 dead transitions. [2022-12-06 05:48:55,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1635 transitions, 58735 flow [2022-12-06 05:48:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:48:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:48:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-12-06 05:48:55,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1536050156739812 [2022-12-06 05:48:55,302 INFO L175 Difference]: Start difference. First operand has 398 places, 1541 transitions, 53032 flow. Second operand 11 states and 147 transitions. [2022-12-06 05:48:55,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1635 transitions, 58735 flow [2022-12-06 05:49:01,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1635 transitions, 58093 flow, removed 272 selfloop flow, removed 8 redundant places. [2022-12-06 05:49:01,401 INFO L231 Difference]: Finished difference. Result has 403 places, 1562 transitions, 54250 flow [2022-12-06 05:49:01,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=52430, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=54250, PETRI_PLACES=403, PETRI_TRANSITIONS=1562} [2022-12-06 05:49:01,402 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 382 predicate places. [2022-12-06 05:49:01,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:01,402 INFO L89 Accepts]: Start accepts. Operand has 403 places, 1562 transitions, 54250 flow [2022-12-06 05:49:01,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:01,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:01,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 1562 transitions, 54250 flow [2022-12-06 05:49:01,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 1562 transitions, 54250 flow [2022-12-06 05:49:02,742 INFO L130 PetriNetUnfolder]: 1465/4124 cut-off events. [2022-12-06 05:49:02,743 INFO L131 PetriNetUnfolder]: For 295265/297112 co-relation queries the response was YES. [2022-12-06 05:49:02,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50770 conditions, 4124 events. 1465/4124 cut-off events. For 295265/297112 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 41018 event pairs, 13 based on Foata normal form. 494/4601 useless extension candidates. Maximal degree in co-relation 50351. Up to 1438 conditions per place. [2022-12-06 05:49:02,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 1562 transitions, 54250 flow [2022-12-06 05:49:02,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 5330 [2022-12-06 05:49:02,837 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:02,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1436 [2022-12-06 05:49:02,838 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 1562 transitions, 54250 flow [2022-12-06 05:49:02,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:02,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:02,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:02,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:03,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:03,044 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1210558802, now seen corresponding path program 1 times [2022-12-06 05:49:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:03,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738268170] [2022-12-06 05:49:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:03,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738268170] [2022-12-06 05:49:03,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738268170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:49:03,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:49:03,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:49:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310813013] [2022-12-06 05:49:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:49:03,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:49:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:49:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:49:03,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 87 [2022-12-06 05:49:03,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1562 transitions, 54250 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:49:03,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:03,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 87 [2022-12-06 05:49:03,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:10,023 INFO L130 PetriNetUnfolder]: 6245/11384 cut-off events. [2022-12-06 05:49:10,023 INFO L131 PetriNetUnfolder]: For 754999/755069 co-relation queries the response was YES. [2022-12-06 05:49:10,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156267 conditions, 11384 events. 6245/11384 cut-off events. For 754999/755069 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 92469 event pairs, 2008 based on Foata normal form. 18/11362 useless extension candidates. Maximal degree in co-relation 154963. Up to 6047 conditions per place. [2022-12-06 05:49:10,159 INFO L137 encePairwiseOnDemand]: 77/87 looper letters, 1762 selfloop transitions, 66 changer transitions 0/1829 dead transitions. [2022-12-06 05:49:10,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1829 transitions, 67286 flow [2022-12-06 05:49:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:49:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:49:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-06 05:49:10,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2689655172413793 [2022-12-06 05:49:10,160 INFO L175 Difference]: Start difference. First operand has 403 places, 1562 transitions, 54250 flow. Second operand 5 states and 117 transitions. [2022-12-06 05:49:10,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1829 transitions, 67286 flow [2022-12-06 05:49:17,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 1829 transitions, 66960 flow, removed 49 selfloop flow, removed 2 redundant places. [2022-12-06 05:49:17,492 INFO L231 Difference]: Finished difference. Result has 405 places, 1561 transitions, 54020 flow [2022-12-06 05:49:17,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=53888, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54020, PETRI_PLACES=405, PETRI_TRANSITIONS=1561} [2022-12-06 05:49:17,493 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 384 predicate places. [2022-12-06 05:49:17,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:17,493 INFO L89 Accepts]: Start accepts. Operand has 405 places, 1561 transitions, 54020 flow [2022-12-06 05:49:17,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:17,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:17,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 405 places, 1561 transitions, 54020 flow [2022-12-06 05:49:17,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 1561 transitions, 54020 flow [2022-12-06 05:49:19,057 INFO L130 PetriNetUnfolder]: 1658/4757 cut-off events. [2022-12-06 05:49:19,058 INFO L131 PetriNetUnfolder]: For 360212/362832 co-relation queries the response was YES. [2022-12-06 05:49:19,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58960 conditions, 4757 events. 1658/4757 cut-off events. For 360212/362832 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 49349 event pairs, 23 based on Foata normal form. 578/5314 useless extension candidates. Maximal degree in co-relation 58462. Up to 1695 conditions per place. [2022-12-06 05:49:19,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 405 places, 1561 transitions, 54020 flow [2022-12-06 05:49:19,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 5328 [2022-12-06 05:49:19,158 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:19,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1666 [2022-12-06 05:49:19,159 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 1561 transitions, 54020 flow [2022-12-06 05:49:19,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 05:49:19,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:19,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:19,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-06 05:49:19,159 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash -740612643, now seen corresponding path program 1 times [2022-12-06 05:49:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:19,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78763068] [2022-12-06 05:49:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78763068] [2022-12-06 05:49:19,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78763068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791017984] [2022-12-06 05:49:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:19,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:19,997 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:19,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-12-06 05:49:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:20,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 05:49:20,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:20,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:20,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2022-12-06 05:49:20,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:20,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 20 [2022-12-06 05:49:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:20,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:20,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:20,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 281 treesize of output 383 [2022-12-06 05:49:20,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:20,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 133 [2022-12-06 05:49:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791017984] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:21,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:49:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283773030] [2022-12-06 05:49:21,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:21,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:49:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:49:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:49:21,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-06 05:49:21,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 1561 transitions, 54020 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:21,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:21,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-06 05:49:21,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:28,768 INFO L130 PetriNetUnfolder]: 6256/11425 cut-off events. [2022-12-06 05:49:28,768 INFO L131 PetriNetUnfolder]: For 745451/745513 co-relation queries the response was YES. [2022-12-06 05:49:28,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156216 conditions, 11425 events. 6256/11425 cut-off events. For 745451/745513 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 93207 event pairs, 1350 based on Foata normal form. 41/11426 useless extension candidates. Maximal degree in co-relation 154912. Up to 11210 conditions per place. [2022-12-06 05:49:28,912 INFO L137 encePairwiseOnDemand]: 37/86 looper letters, 1489 selfloop transitions, 101 changer transitions 7/1598 dead transitions. [2022-12-06 05:49:28,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1598 transitions, 57585 flow [2022-12-06 05:49:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:49:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:49:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-12-06 05:49:28,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12170542635658915 [2022-12-06 05:49:28,913 INFO L175 Difference]: Start difference. First operand has 405 places, 1561 transitions, 54020 flow. Second operand 15 states and 157 transitions. [2022-12-06 05:49:28,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 1598 transitions, 57585 flow [2022-12-06 05:49:37,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1598 transitions, 57484 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:37,083 INFO L231 Difference]: Finished difference. Result has 419 places, 1564 transitions, 54207 flow [2022-12-06 05:49:37,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=53919, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=54207, PETRI_PLACES=419, PETRI_TRANSITIONS=1564} [2022-12-06 05:49:37,084 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 398 predicate places. [2022-12-06 05:49:37,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:37,084 INFO L89 Accepts]: Start accepts. Operand has 419 places, 1564 transitions, 54207 flow [2022-12-06 05:49:37,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:37,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:37,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 1564 transitions, 54207 flow [2022-12-06 05:49:37,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 418 places, 1564 transitions, 54207 flow [2022-12-06 05:49:38,466 INFO L130 PetriNetUnfolder]: 1463/4130 cut-off events. [2022-12-06 05:49:38,467 INFO L131 PetriNetUnfolder]: For 297086/298905 co-relation queries the response was YES. [2022-12-06 05:49:38,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50845 conditions, 4130 events. 1463/4130 cut-off events. For 297086/298905 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 41350 event pairs, 15 based on Foata normal form. 495/4609 useless extension candidates. Maximal degree in co-relation 50413. Up to 1436 conditions per place. [2022-12-06 05:49:38,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 418 places, 1564 transitions, 54207 flow [2022-12-06 05:49:38,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 5332 [2022-12-06 05:49:38,547 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:38,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1463 [2022-12-06 05:49:38,547 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 1564 transitions, 54207 flow [2022-12-06 05:49:38,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:38,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:38,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:38,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:38,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-12-06 05:49:38,755 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1098858294, now seen corresponding path program 1 times [2022-12-06 05:49:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:38,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608739751] [2022-12-06 05:49:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:38,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:38,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608739751] [2022-12-06 05:49:38,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608739751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:38,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315403795] [2022-12-06 05:49:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:38,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:38,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:38,848 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:38,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-12-06 05:49:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:39,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:49:39,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:39,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:49:39,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315403795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:49:39,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:49:39,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-06 05:49:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734773253] [2022-12-06 05:49:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:49:39,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:49:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:49:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:49:39,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-06 05:49:39,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 1564 transitions, 54207 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:39,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:39,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-06 05:49:39,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:45,672 INFO L130 PetriNetUnfolder]: 5794/10519 cut-off events. [2022-12-06 05:49:45,673 INFO L131 PetriNetUnfolder]: For 677916/677993 co-relation queries the response was YES. [2022-12-06 05:49:45,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142805 conditions, 10519 events. 5794/10519 cut-off events. For 677916/677993 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 83202 event pairs, 506 based on Foata normal form. 65/10540 useless extension candidates. Maximal degree in co-relation 142116. Up to 7635 conditions per place. [2022-12-06 05:49:45,821 INFO L137 encePairwiseOnDemand]: 28/86 looper letters, 1081 selfloop transitions, 624 changer transitions 0/1706 dead transitions. [2022-12-06 05:49:45,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1706 transitions, 62229 flow [2022-12-06 05:49:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:49:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:49:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 05:49:45,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26976744186046514 [2022-12-06 05:49:45,822 INFO L175 Difference]: Start difference. First operand has 418 places, 1564 transitions, 54207 flow. Second operand 5 states and 116 transitions. [2022-12-06 05:49:45,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 1706 transitions, 62229 flow [2022-12-06 05:49:52,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 1706 transitions, 62026 flow, removed 26 selfloop flow, removed 9 redundant places. [2022-12-06 05:49:52,558 INFO L231 Difference]: Finished difference. Result has 415 places, 1672 transitions, 60032 flow [2022-12-06 05:49:52,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=53975, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60032, PETRI_PLACES=415, PETRI_TRANSITIONS=1672} [2022-12-06 05:49:52,558 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 394 predicate places. [2022-12-06 05:49:52,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:52,559 INFO L89 Accepts]: Start accepts. Operand has 415 places, 1672 transitions, 60032 flow [2022-12-06 05:49:52,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:52,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:52,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 1672 transitions, 60032 flow [2022-12-06 05:49:52,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 1672 transitions, 60032 flow [2022-12-06 05:49:54,136 INFO L130 PetriNetUnfolder]: 1552/4407 cut-off events. [2022-12-06 05:49:54,137 INFO L131 PetriNetUnfolder]: For 341056/343521 co-relation queries the response was YES. [2022-12-06 05:49:54,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56443 conditions, 4407 events. 1552/4407 cut-off events. For 341056/343521 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 44491 event pairs, 22 based on Foata normal form. 591/4977 useless extension candidates. Maximal degree in co-relation 55993. Up to 1557 conditions per place. [2022-12-06 05:49:54,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 1672 transitions, 60032 flow [2022-12-06 05:49:54,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 5632 [2022-12-06 05:49:54,228 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:54,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1670 [2022-12-06 05:49:54,228 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 1672 transitions, 60032 flow [2022-12-06 05:49:54,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:54,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:54,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:54,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:54,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-12-06 05:49:54,432 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2085970351, now seen corresponding path program 2 times [2022-12-06 05:49:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:54,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266985651] [2022-12-06 05:49:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:55,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266985651] [2022-12-06 05:49:55,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266985651] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:55,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004830669] [2022-12-06 05:49:55,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:49:55,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:55,129 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:49:55,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-12-06 05:49:55,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:49:55,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:49:55,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:49:55,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:55,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:55,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-06 05:49:55,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:55,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 20 [2022-12-06 05:49:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:55,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:55,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:55,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 250 treesize of output 361 [2022-12-06 05:49:55,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:49:55,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 126 [2022-12-06 05:49:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004830669] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:56,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:56,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:49:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507307914] [2022-12-06 05:49:56,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:56,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:49:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:56,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:49:56,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:49:56,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 85 [2022-12-06 05:49:56,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1672 transitions, 60032 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:56,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:56,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 85 [2022-12-06 05:49:56,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:04,337 INFO L130 PetriNetUnfolder]: 5955/10791 cut-off events. [2022-12-06 05:50:04,338 INFO L131 PetriNetUnfolder]: For 735553/735620 co-relation queries the response was YES. [2022-12-06 05:50:04,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151951 conditions, 10791 events. 5955/10791 cut-off events. For 735553/735620 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 85689 event pairs, 1113 based on Foata normal form. 51/10798 useless extension candidates. Maximal degree in co-relation 150836. Up to 10197 conditions per place. [2022-12-06 05:50:04,483 INFO L137 encePairwiseOnDemand]: 34/85 looper letters, 1580 selfloop transitions, 184 changer transitions 10/1775 dead transitions. [2022-12-06 05:50:04,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1775 transitions, 66096 flow [2022-12-06 05:50:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:50:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:50:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 161 transitions. [2022-12-06 05:50:04,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12627450980392158 [2022-12-06 05:50:04,484 INFO L175 Difference]: Start difference. First operand has 415 places, 1672 transitions, 60032 flow. Second operand 15 states and 161 transitions. [2022-12-06 05:50:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 1775 transitions, 66096 flow [2022-12-06 05:50:12,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 1775 transitions, 65987 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-06 05:50:12,531 INFO L231 Difference]: Finished difference. Result has 429 places, 1722 transitions, 62016 flow [2022-12-06 05:50:12,532 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=59918, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=62016, PETRI_PLACES=429, PETRI_TRANSITIONS=1722} [2022-12-06 05:50:12,532 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 408 predicate places. [2022-12-06 05:50:12,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:12,532 INFO L89 Accepts]: Start accepts. Operand has 429 places, 1722 transitions, 62016 flow [2022-12-06 05:50:12,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:12,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:12,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 429 places, 1722 transitions, 62016 flow [2022-12-06 05:50:12,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 427 places, 1722 transitions, 62016 flow [2022-12-06 05:50:14,463 INFO L130 PetriNetUnfolder]: 1602/4502 cut-off events. [2022-12-06 05:50:14,463 INFO L131 PetriNetUnfolder]: For 360596/363012 co-relation queries the response was YES. [2022-12-06 05:50:14,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59156 conditions, 4502 events. 1602/4502 cut-off events. For 360596/363012 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 45406 event pairs, 23 based on Foata normal form. 603/5080 useless extension candidates. Maximal degree in co-relation 58699. Up to 1638 conditions per place. [2022-12-06 05:50:14,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 427 places, 1722 transitions, 62016 flow [2022-12-06 05:50:14,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 5746 [2022-12-06 05:50:15,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [956] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1099| v_~q~0.base_745)) (.cse1 (* v_~q_back~0_1691 4))) (and (not (= (ite (and (<= 1 v_~q_back~0_1689) (< v_~q_back~0_1689 (+ v_~n~0_732 1))) 1 0) 0)) (= (ite (and (< v_~q_front~0_1584 (+ 3 v_~q_back~0_1691)) (<= 0 v_~q_front~0_1584) (< v_~q_front~0_1584 v_~n~0_732)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_950|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_934| 0)) (= v_~q_front~0_1583 (+ v_~q_front~0_1584 1)) (not (= (ite (and (< v_~q_back~0_1691 v_~n~0_732) (<= 0 v_~q_back~0_1691)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_366| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_950| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1038| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_934| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_934|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_969| v_~N~0_580)) (= (ite (= (select .cse0 (+ (* v_~q_back~0_1689 4) (- 4) v_~q~0.offset_745)) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_934|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_745 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_969| 4) (= (+ 5 v_~q_back~0_1691) v_~q_back~0_1689) (< 3 v_~N~0_580) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_745 .cse1)) 1) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1038| v_~s~0_1523) v_~s~0_1522) (= |v_thread1Thread1of1ForFork0_#res#1.base_366| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_950| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_950|) (= (select .cse0 (+ (* v_~q_front~0_1584 4) v_~q~0.offset_745)) |v_thread2Thread1of1ForFork1_~j~0#1_1038|) (not (= (ite (= (select .cse0 (+ v_~q~0.offset_745 .cse1 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_745 .cse1)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1691, #memory_int=|v_#memory_int_1099|, ~N~0=v_~N~0_580, ~q~0.base=v_~q~0.base_745, ~n~0=v_~n~0_732, ~q~0.offset=v_~q~0.offset_745, ~s~0=v_~s~0_1523, ~q_front~0=v_~q_front~0_1584} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1038|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_366|, ~q_back~0=v_~q_back~0_1689, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_384|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_950|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_689|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_950|, ~N~0=v_~N~0_580, ~q~0.base=v_~q~0.base_745, ~q~0.offset=v_~q~0.offset_745, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_950|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_950|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_934|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_693|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_689|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_969|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_384|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_934|, #memory_int=|v_#memory_int_1099|, ~n~0=v_~n~0_732, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_366|, ~s~0=v_~s~0_1522, ~q_front~0=v_~q_front~0_1583} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1, thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, 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_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#res#1.base, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:50:15,598 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:50:15,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3066 [2022-12-06 05:50:15,598 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 1721 transitions, 62036 flow [2022-12-06 05:50:15,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:15,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:15,599 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:15,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-12-06 05:50:15,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-12-06 05:50:15,807 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1893689085, now seen corresponding path program 1 times [2022-12-06 05:50:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:15,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633367820] [2022-12-06 05:50:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:16,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633367820] [2022-12-06 05:50:16,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633367820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:16,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117460984] [2022-12-06 05:50:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:16,745 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:50:16,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-12-06 05:50:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:17,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 05:50:17,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:50:17,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-06 05:50:17,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:17,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 16 [2022-12-06 05:50:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:17,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:17,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:17,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 222 [2022-12-06 05:50:17,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:17,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 69 [2022-12-06 05:50:17,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:50:17,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 49 [2022-12-06 05:50:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:17,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117460984] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:17,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:17,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 05:50:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064479005] [2022-12-06 05:50:17,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:17,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:50:17,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:50:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:50:17,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-06 05:50:17,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1721 transitions, 62036 flow. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:17,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:17,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-06 05:50:17,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:25,205 INFO L130 PetriNetUnfolder]: 6048/10978 cut-off events. [2022-12-06 05:50:25,205 INFO L131 PetriNetUnfolder]: For 798057/798126 co-relation queries the response was YES. [2022-12-06 05:50:25,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158126 conditions, 10978 events. 6048/10978 cut-off events. For 798057/798126 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 88092 event pairs, 1810 based on Foata normal form. 29/10963 useless extension candidates. Maximal degree in co-relation 157008. Up to 10518 conditions per place. [2022-12-06 05:50:25,341 INFO L137 encePairwiseOnDemand]: 20/86 looper letters, 1629 selfloop transitions, 148 changer transitions 32/1810 dead transitions. [2022-12-06 05:50:25,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 1810 transitions, 67612 flow [2022-12-06 05:50:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:50:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:50:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 198 transitions. [2022-12-06 05:50:25,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11511627906976744 [2022-12-06 05:50:25,343 INFO L175 Difference]: Start difference. First operand has 426 places, 1721 transitions, 62036 flow. Second operand 20 states and 198 transitions. [2022-12-06 05:50:25,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 1810 transitions, 67612 flow [2022-12-06 05:50:33,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1810 transitions, 67133 flow, removed 118 selfloop flow, removed 9 redundant places. [2022-12-06 05:50:33,895 INFO L231 Difference]: Finished difference. Result has 444 places, 1735 transitions, 62740 flow [2022-12-06 05:50:33,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=61565, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=62740, PETRI_PLACES=444, PETRI_TRANSITIONS=1735} [2022-12-06 05:50:33,896 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 423 predicate places. [2022-12-06 05:50:33,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:33,896 INFO L89 Accepts]: Start accepts. Operand has 444 places, 1735 transitions, 62740 flow [2022-12-06 05:50:33,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:33,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:33,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 444 places, 1735 transitions, 62740 flow [2022-12-06 05:50:33,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 1735 transitions, 62740 flow [2022-12-06 05:50:35,447 INFO L130 PetriNetUnfolder]: 1611/4514 cut-off events. [2022-12-06 05:50:35,448 INFO L131 PetriNetUnfolder]: For 369356/371833 co-relation queries the response was YES. [2022-12-06 05:50:35,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60035 conditions, 4514 events. 1611/4514 cut-off events. For 369356/371833 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 45612 event pairs, 24 based on Foata normal form. 573/5058 useless extension candidates. Maximal degree in co-relation 59839. Up to 1654 conditions per place. [2022-12-06 05:50:35,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 440 places, 1735 transitions, 62740 flow [2022-12-06 05:50:35,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 5784 [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE62 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE246 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,557 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,558 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,558 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:35,558 WARN L322 ript$VariableManager]: TermVariable LBE50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:36,247 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:36,248 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:37,014 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:37,014 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:50:37,976 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:50:37,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4080 [2022-12-06 05:50:37,976 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 1734 transitions, 62790 flow [2022-12-06 05:50:37,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:37,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:37,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:37,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-12-06 05:50:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:38,182 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 97532680, now seen corresponding path program 1 times [2022-12-06 05:50:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359512025] [2022-12-06 05:50:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:38,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359512025] [2022-12-06 05:50:38,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359512025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:50:38,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:50:38,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:50:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322735791] [2022-12-06 05:50:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:50:38,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:50:38,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:50:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:50:38,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 87 [2022-12-06 05:50:38,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1734 transitions, 62790 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 05:50:38,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:38,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 87 [2022-12-06 05:50:38,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:45,781 INFO L130 PetriNetUnfolder]: 5969/10798 cut-off events. [2022-12-06 05:50:45,781 INFO L131 PetriNetUnfolder]: For 763044/763128 co-relation queries the response was YES. [2022-12-06 05:50:45,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155254 conditions, 10798 events. 5969/10798 cut-off events. For 763044/763128 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 85211 event pairs, 1252 based on Foata normal form. 58/10812 useless extension candidates. Maximal degree in co-relation 154975. Up to 10736 conditions per place. [2022-12-06 05:50:45,946 INFO L137 encePairwiseOnDemand]: 52/87 looper letters, 1696 selfloop transitions, 39 changer transitions 1/1737 dead transitions. [2022-12-06 05:50:45,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 1737 transitions, 66133 flow [2022-12-06 05:50:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:50:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:50:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-12-06 05:50:45,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.367816091954023 [2022-12-06 05:50:45,947 INFO L175 Difference]: Start difference. First operand has 439 places, 1734 transitions, 62790 flow. Second operand 3 states and 96 transitions. [2022-12-06 05:50:45,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 1737 transitions, 66133 flow [2022-12-06 05:50:54,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 1737 transitions, 65456 flow, removed 306 selfloop flow, removed 6 redundant places. [2022-12-06 05:50:54,362 INFO L231 Difference]: Finished difference. Result has 434 places, 1732 transitions, 61996 flow [2022-12-06 05:50:54,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=61965, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61996, PETRI_PLACES=434, PETRI_TRANSITIONS=1732} [2022-12-06 05:50:54,363 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 413 predicate places. [2022-12-06 05:50:54,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:54,363 INFO L89 Accepts]: Start accepts. Operand has 434 places, 1732 transitions, 61996 flow [2022-12-06 05:50:54,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:54,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:54,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 1732 transitions, 61996 flow [2022-12-06 05:50:54,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 433 places, 1732 transitions, 61996 flow [2022-12-06 05:50:56,120 INFO L130 PetriNetUnfolder]: 1610/4505 cut-off events. [2022-12-06 05:50:56,121 INFO L131 PetriNetUnfolder]: For 366428/368885 co-relation queries the response was YES. [2022-12-06 05:50:56,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58826 conditions, 4505 events. 1610/4505 cut-off events. For 366428/368885 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 45201 event pairs, 22 based on Foata normal form. 578/5055 useless extension candidates. Maximal degree in co-relation 58368. Up to 1620 conditions per place. [2022-12-06 05:50:56,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 433 places, 1732 transitions, 61996 flow [2022-12-06 05:50:56,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 5768 [2022-12-06 05:50:56,225 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:50:56,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1863 [2022-12-06 05:50:56,226 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 1732 transitions, 61996 flow [2022-12-06 05:50:56,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 05:50:56,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:56,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:56,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-06 05:50:56,226 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1110678061, now seen corresponding path program 1 times [2022-12-06 05:50:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:56,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250668187] [2022-12-06 05:50:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:56,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250668187] [2022-12-06 05:50:56,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250668187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:50:56,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:50:56,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:50:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372680475] [2022-12-06 05:50:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:50:56,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:50:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:50:56,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:50:56,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 85 [2022-12-06 05:50:56,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 1732 transitions, 61996 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:56,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:56,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 85 [2022-12-06 05:50:56,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:03,944 INFO L130 PetriNetUnfolder]: 5967/10798 cut-off events. [2022-12-06 05:51:03,945 INFO L131 PetriNetUnfolder]: For 746088/746178 co-relation queries the response was YES. [2022-12-06 05:51:04,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152856 conditions, 10798 events. 5967/10798 cut-off events. For 746088/746178 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 85409 event pairs, 1106 based on Foata normal form. 55/10809 useless extension candidates. Maximal degree in co-relation 151737. Up to 10708 conditions per place. [2022-12-06 05:51:04,103 INFO L137 encePairwiseOnDemand]: 42/85 looper letters, 1677 selfloop transitions, 60 changer transitions 2/1740 dead transitions. [2022-12-06 05:51:04,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 1740 transitions, 65515 flow [2022-12-06 05:51:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:51:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:51:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-06 05:51:04,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28823529411764703 [2022-12-06 05:51:04,112 INFO L175 Difference]: Start difference. First operand has 433 places, 1732 transitions, 61996 flow. Second operand 4 states and 98 transitions. [2022-12-06 05:51:04,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 1740 transitions, 65515 flow [2022-12-06 05:51:11,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 1740 transitions, 65425 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:51:11,785 INFO L231 Difference]: Finished difference. Result has 434 places, 1733 transitions, 62043 flow [2022-12-06 05:51:11,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=61906, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62043, PETRI_PLACES=434, PETRI_TRANSITIONS=1733} [2022-12-06 05:51:11,786 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 413 predicate places. [2022-12-06 05:51:11,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:11,786 INFO L89 Accepts]: Start accepts. Operand has 434 places, 1733 transitions, 62043 flow [2022-12-06 05:51:11,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:11,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:11,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 1733 transitions, 62043 flow [2022-12-06 05:51:11,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 434 places, 1733 transitions, 62043 flow [2022-12-06 05:51:13,553 INFO L130 PetriNetUnfolder]: 1609/4507 cut-off events. [2022-12-06 05:51:13,553 INFO L131 PetriNetUnfolder]: For 367972/370435 co-relation queries the response was YES. [2022-12-06 05:51:13,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58940 conditions, 4507 events. 1609/4507 cut-off events. For 367972/370435 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 45329 event pairs, 23 based on Foata normal form. 578/5057 useless extension candidates. Maximal degree in co-relation 58476. Up to 1620 conditions per place. [2022-12-06 05:51:13,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 1733 transitions, 62043 flow [2022-12-06 05:51:13,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 5774 [2022-12-06 05:51:13,701 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:13,701 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:51:14,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:51:14,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2752 [2022-12-06 05:51:14,538 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 1732 transitions, 62033 flow [2022-12-06 05:51:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:14,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:14,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:14,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-06 05:51:14,538 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1156832969, now seen corresponding path program 1 times [2022-12-06 05:51:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:14,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140732732] [2022-12-06 05:51:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:14,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:14,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140732732] [2022-12-06 05:51:14,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140732732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:51:14,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:51:14,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:51:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803557759] [2022-12-06 05:51:14,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:51:14,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:51:14,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:14,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:51:14,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:51:14,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 85 [2022-12-06 05:51:14,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 1732 transitions, 62033 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:14,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:14,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 85 [2022-12-06 05:51:14,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:21,085 INFO L130 PetriNetUnfolder]: 5959/10781 cut-off events. [2022-12-06 05:51:21,085 INFO L131 PetriNetUnfolder]: For 736241/736323 co-relation queries the response was YES. [2022-12-06 05:51:21,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152802 conditions, 10781 events. 5959/10781 cut-off events. For 736241/736323 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 85781 event pairs, 1098 based on Foata normal form. 56/10793 useless extension candidates. Maximal degree in co-relation 151825. Up to 10701 conditions per place. [2022-12-06 05:51:21,445 INFO L137 encePairwiseOnDemand]: 44/85 looper letters, 1674 selfloop transitions, 58 changer transitions 0/1733 dead transitions. [2022-12-06 05:51:21,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1733 transitions, 65447 flow [2022-12-06 05:51:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:51:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:51:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-12-06 05:51:21,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3568627450980392 [2022-12-06 05:51:21,446 INFO L175 Difference]: Start difference. First operand has 433 places, 1732 transitions, 62033 flow. Second operand 3 states and 91 transitions. [2022-12-06 05:51:21,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1733 transitions, 65447 flow [2022-12-06 05:51:29,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 1733 transitions, 65327 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:51:29,841 INFO L231 Difference]: Finished difference. Result has 432 places, 1731 transitions, 61974 flow [2022-12-06 05:51:29,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=61858, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61974, PETRI_PLACES=432, PETRI_TRANSITIONS=1731} [2022-12-06 05:51:29,842 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 411 predicate places. [2022-12-06 05:51:29,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:29,842 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1731 transitions, 61974 flow [2022-12-06 05:51:29,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:29,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:29,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1731 transitions, 61974 flow [2022-12-06 05:51:29,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 1731 transitions, 61974 flow [2022-12-06 05:51:31,411 INFO L130 PetriNetUnfolder]: 1607/4499 cut-off events. [2022-12-06 05:51:31,411 INFO L131 PetriNetUnfolder]: For 364842/367482 co-relation queries the response was YES. [2022-12-06 05:51:31,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58769 conditions, 4499 events. 1607/4499 cut-off events. For 364842/367482 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 45463 event pairs, 22 based on Foata normal form. 581/5054 useless extension candidates. Maximal degree in co-relation 58312. Up to 1619 conditions per place. [2022-12-06 05:51:31,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 1731 transitions, 61974 flow [2022-12-06 05:51:31,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 5766 [2022-12-06 05:51:31,508 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:51:31,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1666 [2022-12-06 05:51:31,508 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 1731 transitions, 61974 flow [2022-12-06 05:51:31,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:31,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:31,508 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:31,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-06 05:51:31,509 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 25549244, now seen corresponding path program 1 times [2022-12-06 05:51:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:31,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652865939] [2022-12-06 05:51:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:31,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652865939] [2022-12-06 05:51:31,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652865939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:51:31,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888659547] [2022-12-06 05:51:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:31,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:51:31,768 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:51:31,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-12-06 05:51:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:32,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:51:32,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:51:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:32,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:51:32,168 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:51:32,168 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 27 treesize of output 16 [2022-12-06 05:51:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:32,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888659547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:51:32,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:51:32,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-12-06 05:51:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339279901] [2022-12-06 05:51:32,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:51:32,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:51:32,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:51:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:51:32,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 84 [2022-12-06 05:51:32,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1731 transitions, 61974 flow. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:32,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:32,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 84 [2022-12-06 05:51:32,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:40,114 INFO L130 PetriNetUnfolder]: 6205/11228 cut-off events. [2022-12-06 05:51:40,114 INFO L131 PetriNetUnfolder]: For 875502/875579 co-relation queries the response was YES. [2022-12-06 05:51:40,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159417 conditions, 11228 events. 6205/11228 cut-off events. For 875502/875579 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 89540 event pairs, 946 based on Foata normal form. 216/11400 useless extension candidates. Maximal degree in co-relation 158299. Up to 8016 conditions per place. [2022-12-06 05:51:40,265 INFO L137 encePairwiseOnDemand]: 39/84 looper letters, 1422 selfloop transitions, 551 changer transitions 0/1974 dead transitions. [2022-12-06 05:51:40,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 1974 transitions, 72434 flow [2022-12-06 05:51:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:51:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:51:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2022-12-06 05:51:40,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15567765567765568 [2022-12-06 05:51:40,266 INFO L175 Difference]: Start difference. First operand has 432 places, 1731 transitions, 61974 flow. Second operand 13 states and 170 transitions. [2022-12-06 05:51:40,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 1974 transitions, 72434 flow [2022-12-06 05:51:48,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 1974 transitions, 72314 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:51:49,005 INFO L231 Difference]: Finished difference. Result has 444 places, 1782 transitions, 65587 flow [2022-12-06 05:51:49,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=61841, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=505, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=65587, PETRI_PLACES=444, PETRI_TRANSITIONS=1782} [2022-12-06 05:51:49,006 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 423 predicate places. [2022-12-06 05:51:49,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:49,006 INFO L89 Accepts]: Start accepts. Operand has 444 places, 1782 transitions, 65587 flow [2022-12-06 05:51:49,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:49,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:49,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 444 places, 1782 transitions, 65587 flow [2022-12-06 05:51:49,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 1782 transitions, 65587 flow [2022-12-06 05:51:50,885 INFO L130 PetriNetUnfolder]: 1663/4665 cut-off events. [2022-12-06 05:51:50,885 INFO L131 PetriNetUnfolder]: For 390599/393188 co-relation queries the response was YES. [2022-12-06 05:51:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62226 conditions, 4665 events. 1663/4665 cut-off events. For 390599/393188 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 47224 event pairs, 22 based on Foata normal form. 604/5243 useless extension candidates. Maximal degree in co-relation 61767. Up to 1695 conditions per place. [2022-12-06 05:51:50,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 444 places, 1782 transitions, 65587 flow [2022-12-06 05:51:50,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 5998 [2022-12-06 05:51:50,997 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:51:50,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1992 [2022-12-06 05:51:50,998 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 1782 transitions, 65587 flow [2022-12-06 05:51:50,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:50,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:50,998 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:51,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-12-06 05:51:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:51,204 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -827406971, now seen corresponding path program 1 times [2022-12-06 05:51:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:51,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489850976] [2022-12-06 05:51:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:52,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489850976] [2022-12-06 05:51:52,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489850976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:51:52,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293785307] [2022-12-06 05:51:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:52,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:52,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:51:52,134 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:51:52,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-12-06 05:51:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:52,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:51:52,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:51:52,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:52,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 20 [2022-12-06 05:51:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:52,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:51:52,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:51:52,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 252 [2022-12-06 05:51:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:52,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293785307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:51:52,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:51:52,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 05:51:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571298950] [2022-12-06 05:51:52,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:51:52,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:51:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:51:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:51:52,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 84 [2022-12-06 05:51:52,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 1782 transitions, 65587 flow. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:52,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:52,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 84 [2022-12-06 05:51:52,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:01,334 INFO L130 PetriNetUnfolder]: 6237/11327 cut-off events. [2022-12-06 05:52:01,334 INFO L131 PetriNetUnfolder]: For 829058/829103 co-relation queries the response was YES. [2022-12-06 05:52:01,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163810 conditions, 11327 events. 6237/11327 cut-off events. For 829058/829103 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 90847 event pairs, 1995 based on Foata normal form. 12/11295 useless extension candidates. Maximal degree in co-relation 162456. Up to 11013 conditions per place. [2022-12-06 05:52:01,496 INFO L137 encePairwiseOnDemand]: 37/84 looper letters, 1704 selfloop transitions, 119 changer transitions 22/1846 dead transitions. [2022-12-06 05:52:01,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1846 transitions, 70306 flow [2022-12-06 05:52:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:52:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:52:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-12-06 05:52:01,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12394957983193278 [2022-12-06 05:52:01,497 INFO L175 Difference]: Start difference. First operand has 444 places, 1782 transitions, 65587 flow. Second operand 17 states and 177 transitions. [2022-12-06 05:52:01,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1846 transitions, 70306 flow [2022-12-06 05:52:11,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1846 transitions, 69814 flow, removed 214 selfloop flow, removed 3 redundant places. [2022-12-06 05:52:11,276 INFO L231 Difference]: Finished difference. Result has 462 places, 1791 transitions, 65641 flow [2022-12-06 05:52:11,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=65095, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=65641, PETRI_PLACES=462, PETRI_TRANSITIONS=1791} [2022-12-06 05:52:11,277 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 441 predicate places. [2022-12-06 05:52:11,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:11,277 INFO L89 Accepts]: Start accepts. Operand has 462 places, 1791 transitions, 65641 flow [2022-12-06 05:52:11,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:11,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:11,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 462 places, 1791 transitions, 65641 flow [2022-12-06 05:52:11,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 459 places, 1791 transitions, 65641 flow [2022-12-06 05:52:13,052 INFO L130 PetriNetUnfolder]: 1664/4681 cut-off events. [2022-12-06 05:52:13,052 INFO L131 PetriNetUnfolder]: For 388259/390865 co-relation queries the response was YES. [2022-12-06 05:52:13,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62469 conditions, 4681 events. 1664/4681 cut-off events. For 388259/390865 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 47502 event pairs, 25 based on Foata normal form. 591/5244 useless extension candidates. Maximal degree in co-relation 62025. Up to 1704 conditions per place. [2022-12-06 05:52:13,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 1791 transitions, 65641 flow [2022-12-06 05:52:13,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 6012 [2022-12-06 05:52:13,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [895] $Ultimate##0-->L65-2: Formula: (let ((.cse2 (select |v_#memory_int_994| v_~q~0.base_667))) (let ((.cse1 (select .cse2 (+ v_~q~0.offset_667 (* v_~q_front~0_1339 4)))) (.cse0 (+ v_~n~0_654 1)) (.cse3 (* v_~q_back~0_1460 4))) (and (not (= (ite (and (< v_~q_back~0_1459 .cse0) (<= 1 v_~q_back~0_1459)) 1 0) 0)) (not (= .cse1 0)) (= (+ v_~q_back~0_1460 4) v_~q_back~0_1459) (= (ite (= (select .cse2 (+ (- 4) v_~q~0.offset_667 (* v_~q_back~0_1459 4))) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_785|) (not (= (ite (and (<= 0 v_~q_back~0_1460) (< v_~q_back~0_1460 v_~n~0_654)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_785| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_785| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_785|) (not (= (ite (and (<= 0 v_~q_front~0_1339) (< v_~q_front~0_1339 v_~n~0_654) (< (+ v_~q_front~0_1339 1) v_~q_back~0_1459)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_793| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_793|) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_667)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ .cse3 v_~q~0.offset_667 4)) 1) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_797| (+ v_~N~0_512 1)) (= (+ v_~s~0_1273 .cse1 |v_thread2Thread1of1ForFork1_~j~0#1_868|) v_~s~0_1271) (= |v_thread2Thread1of1ForFork1_~j~0#1_868| (select .cse2 (+ (- 4) v_~q~0.offset_667 (* v_~q_front~0_1337 4)))) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_868| 0)) (= (+ v_~q_front~0_1339 2) v_~q_front~0_1337) (= |v_thread1Thread1of1ForFork0_~i~0#1_797| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_793| (ite (and (< v_~q_front~0_1337 .cse0) (< v_~q_front~0_1337 (+ v_~q_back~0_1459 1)) (<= 1 v_~q_front~0_1337)) 1 0)) (not (= (ite (= (select .cse2 (+ .cse3 8 v_~q~0.offset_667)) 1) 1 0) 0))))) InVars {~q_back~0=v_~q_back~0_1460, #memory_int=|v_#memory_int_994|, ~N~0=v_~N~0_512, ~q~0.base=v_~q~0.base_667, ~n~0=v_~n~0_654, ~q~0.offset=v_~q~0.offset_667, ~s~0=v_~s~0_1273, ~q_front~0=v_~q_front~0_1339} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_868|, ~q_back~0=v_~q_back~0_1459, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_793|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_793|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_567|, ~N~0=v_~N~0_512, ~q~0.base=v_~q~0.base_667, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_793|, ~q~0.offset=v_~q~0.offset_667, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_793|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_785|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_571|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_567|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_797|, #memory_int=|v_#memory_int_994|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_785|, ~n~0=v_~n~0_654, ~s~0=v_~s~0_1271, ~q_front~0=v_~q_front~0_1337} 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, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:52:13,162 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,163 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,163 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,163 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,163 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,163 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,661 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,661 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,661 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,661 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,661 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,661 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:13,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:52:13,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2721 [2022-12-06 05:52:13,998 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 1791 transitions, 65711 flow [2022-12-06 05:52:13,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:13,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:13,998 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:14,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-12-06 05:52:14,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:14,204 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -451753520, now seen corresponding path program 1 times [2022-12-06 05:52:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:14,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165916833] [2022-12-06 05:52:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165916833] [2022-12-06 05:52:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165916833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582846373] [2022-12-06 05:52:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:14,700 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:52:14,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-12-06 05:52:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:15,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:52:15,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:15,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:15,143 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 05:52:15,143 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 27 treesize of output 18 [2022-12-06 05:52:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:15,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582846373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:15,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:15,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:52:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576289317] [2022-12-06 05:52:15,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:15,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:52:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:52:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:52:15,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 86 [2022-12-06 05:52:15,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1791 transitions, 65711 flow. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:15,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:15,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 86 [2022-12-06 05:52:15,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:25,173 INFO L130 PetriNetUnfolder]: 7420/13308 cut-off events. [2022-12-06 05:52:25,173 INFO L131 PetriNetUnfolder]: For 1148768/1148843 co-relation queries the response was YES. [2022-12-06 05:52:25,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194189 conditions, 13308 events. 7420/13308 cut-off events. For 1148768/1148843 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 108942 event pairs, 454 based on Foata normal form. 429/13721 useless extension candidates. Maximal degree in co-relation 193262. Up to 5541 conditions per place. [2022-12-06 05:52:25,376 INFO L137 encePairwiseOnDemand]: 23/86 looper letters, 768 selfloop transitions, 1602 changer transitions 0/2371 dead transitions. [2022-12-06 05:52:25,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 2371 transitions, 88567 flow [2022-12-06 05:52:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 05:52:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 05:52:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 300 transitions. [2022-12-06 05:52:25,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09689922480620156 [2022-12-06 05:52:25,378 INFO L175 Difference]: Start difference. First operand has 459 places, 1791 transitions, 65711 flow. Second operand 36 states and 300 transitions. [2022-12-06 05:52:25,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 2371 transitions, 88567 flow [2022-12-06 05:52:36,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 2371 transitions, 88203 flow, removed 97 selfloop flow, removed 5 redundant places. [2022-12-06 05:52:37,026 INFO L231 Difference]: Finished difference. Result has 501 places, 2224 transitions, 87291 flow [2022-12-06 05:52:37,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=64813, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=87291, PETRI_PLACES=501, PETRI_TRANSITIONS=2224} [2022-12-06 05:52:37,032 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 480 predicate places. [2022-12-06 05:52:37,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:37,033 INFO L89 Accepts]: Start accepts. Operand has 501 places, 2224 transitions, 87291 flow [2022-12-06 05:52:37,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:37,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:37,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 501 places, 2224 transitions, 87291 flow [2022-12-06 05:52:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 501 places, 2224 transitions, 87291 flow [2022-12-06 05:52:39,734 INFO L130 PetriNetUnfolder]: 1972/5452 cut-off events. [2022-12-06 05:52:39,734 INFO L131 PetriNetUnfolder]: For 485782/488449 co-relation queries the response was YES. [2022-12-06 05:52:39,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78579 conditions, 5452 events. 1972/5452 cut-off events. For 485782/488449 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 57174 event pairs, 22 based on Foata normal form. 631/6065 useless extension candidates. Maximal degree in co-relation 78190. Up to 2109 conditions per place. [2022-12-06 05:52:39,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 501 places, 2224 transitions, 87291 flow [2022-12-06 05:52:39,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 7484 [2022-12-06 05:52:39,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [967] $Ultimate##0-->L47-4: Formula: (let ((.cse2 (select |v_#memory_int_1115| v_~q~0.base_757))) (let ((.cse1 (select .cse2 (+ (* v_~q_front~0_1638 4) v_~q~0.offset_757))) (.cse0 (+ 5 v_~q_back~0_1724)) (.cse3 (* v_~q_back~0_1724 4))) (and (< 4 v_~N~0_592) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_1078| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_987| (ite (and (< v_~q_front~0_1637 (+ v_~n~0_744 1)) (< v_~q_front~0_1637 .cse0) (<= 1 v_~q_front~0_1637)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_987| 5) (not (= .cse1 0)) (= (+ |v_thread2Thread1of1ForFork1_~j~0#1_1078| .cse1 v_~s~0_1577) v_~s~0_1576) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957| 0)) (not (= (ite (= (select .cse2 (+ 12 v_~q~0.offset_757 .cse3)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_1078| (select .cse2 (+ (- 4) v_~q~0.offset_757 (* v_~q_front~0_1637 4)))) (= v_~q_front~0_1637 (+ v_~q_front~0_1638 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957| (ite (= (select .cse2 (+ 16 v_~q~0.offset_757 .cse3)) 1) 1 0)) (not (= (ite (and (<= 0 v_~q_front~0_1638) (< v_~q_front~0_1638 (+ 3 v_~q_back~0_1724)) (< v_~q_front~0_1638 v_~n~0_744)) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1724 v_~n~0_744) (<= 0 v_~q_back~0_1724)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_987| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_987|) (= .cse0 v_~q_back~0_1722) (not (= (ite (= (select .cse2 (+ v_~q~0.offset_757 .cse3 4)) 1) 1 0) 0)) (not (= (ite (= (select .cse2 (+ 8 v_~q~0.offset_757 .cse3)) 1) 1 0) 0)) (not (= (ite (let ((.cse4 (+ v_~q_back~0_1724 4))) (and (<= 0 .cse4) (< .cse4 v_~n~0_744))) 1 0) 0)) (not (= (ite (= (select .cse2 (+ v_~q~0.offset_757 .cse3)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957|)))) InVars {~q_back~0=v_~q_back~0_1724, #memory_int=|v_#memory_int_1115|, ~N~0=v_~N~0_592, ~q~0.base=v_~q~0.base_757, ~n~0=v_~n~0_744, ~q~0.offset=v_~q~0.offset_757, ~s~0=v_~s~0_1577, ~q_front~0=v_~q_front~0_1638} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1078|, ~q_back~0=v_~q_back~0_1722, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_987|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_707|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_987|, ~N~0=v_~N~0_592, ~q~0.base=v_~q~0.base_757, ~q~0.offset=v_~q~0.offset_757, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_987|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_987|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_957|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_711|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_707|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_987|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_957|, #memory_int=|v_#memory_int_1115|, ~n~0=v_~n~0_744, ~s~0=v_~s~0_1576, ~q_front~0=v_~q_front~0_1637} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:52:41,035 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:41,036 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:41,036 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:41,036 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:41,306 WARN L322 ript$VariableManager]: TermVariable LBE267 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:41,306 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:52:41,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] and [521] L47-4-->L47-4: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_178) (< v_~q_back~0_178 v_~n~0_109)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= v_~q_back~0_177 (+ v_~q_back~0_178 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~N~0_55) (= (ite (= (select (select |v_#memory_int_128| v_~q~0.base_104) (+ (* v_~q_back~0_178 4) v_~q~0.offset_104)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)) InVars {~q_back~0=v_~q_back~0_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|, #memory_int=|v_#memory_int_128|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_25|, ~q_back~0=v_~q_back~0_177, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_23|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, #memory_int=|v_#memory_int_128|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~N~0=v_~N~0_55, ~q~0.base=v_~q~0.base_104, ~n~0=v_~n~0_109, ~q~0.offset=v_~q~0.offset_104} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] [2022-12-06 05:52:41,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [973] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1125| v_~q~0.base_765)) (.cse2 (select |v_#memory_int_1124| v_~q~0.base_765)) (.cse1 (* v_~q_back~0_1749 4))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_973| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_973| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_973|) (< 3 v_~N~0_600) (= (+ |v_#pthreadsForks_407| 1) |v_#pthreadsForks_406|) (= |v_ULTIMATE.start_main_#t~pre14#1_350| |v_#pthreadsForks_407|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_765 4)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_973| (ite (= (select .cse2 (+ .cse1 12 v_~q~0.offset_765)) 1) 1 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_765)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_1000| 4) (not (= (ite (let ((.cse3 (+ 3 v_~q_back~0_1749))) (and (<= 0 .cse3) (< .cse3 v_~n~0_752))) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_1749 v_~n~0_752) (<= 0 v_~q_back~0_1749)) 1 0) 0)) (= (+ v_~q_back~0_1749 4) v_~q_back~0_1747) (= (store |v_#memory_int_1125| |v_ULTIMATE.start_main_~#t2~0#1.base_183| (store (select |v_#memory_int_1125| |v_ULTIMATE.start_main_~#t2~0#1.base_183|) |v_ULTIMATE.start_main_~#t2~0#1.offset_180| |v_ULTIMATE.start_main_#t~pre14#1_350|)) |v_#memory_int_1124|) (not (= (ite (= (select .cse2 (+ .cse1 8 v_~q~0.offset_765)) 1) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1749, #pthreadsForks=|v_#pthreadsForks_407|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_180|, #memory_int=|v_#memory_int_1125|, ~N~0=v_~N~0_600, ~q~0.base=v_~q~0.base_765, ~n~0=v_~n~0_752, ~q~0.offset=v_~q~0.offset_765, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_183|} OutVars{~q_back~0=v_~q_back~0_1747, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_180|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_720|, ~N~0=v_~N~0_600, ~q~0.base=v_~q~0.base_765, ~q~0.offset=v_~q~0.offset_765, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_973|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_303|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_724|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_350|, #pthreadsForks=|v_#pthreadsForks_406|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_720|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1000|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_973|, #memory_int=|v_#memory_int_1124|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_258|, ~n~0=v_~n~0_752, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_183|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#t~mem2#1] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:52:42,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [978] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse3 (select |v_#memory_int_1137| v_~q~0.base_773)) (.cse0 (select |v_#memory_int_1136| v_~q~0.base_773)) (.cse1 (* v_~q_back~0_1765 4))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_981| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_388| 0) (= (+ 5 v_~q_back~0_1765) v_~q_back~0_1763) (not (= (ite (and (<= 0 v_~q_back~0_1765) (< v_~q_back~0_1765 v_~n~0_760)) 1 0) 0)) (< 3 v_~N~0_606) (= |v_ULTIMATE.start_main_#t~pre14#1_354| |v_#pthreadsForks_415|) (not (= (ite (= (select .cse0 (+ 12 v_~q~0.offset_773 .cse1)) 1) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~q_back~0_1765 4))) (and (< .cse2 v_~n~0_760) (<= 0 .cse2))) 1 0) 0)) (not (= (ite (= (select .cse3 (+ v_~q~0.offset_773 .cse1)) 1) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_1010| v_~N~0_606)) (not (= (ite (= (select .cse0 (+ 8 v_~q~0.offset_773 .cse1)) 1) 1 0) 0)) (= |v_#memory_int_1136| (store |v_#memory_int_1137| |v_ULTIMATE.start_main_~#t2~0#1.base_187| (store (select |v_#memory_int_1137| |v_ULTIMATE.start_main_~#t2~0#1.base_187|) |v_ULTIMATE.start_main_~#t2~0#1.offset_184| |v_ULTIMATE.start_main_#t~pre14#1_354|))) (not (= (ite (= (select .cse3 (+ v_~q~0.offset_773 4 .cse1)) 1) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_388| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_981| (ite (= 0 (select .cse0 (+ 16 v_~q~0.offset_773 .cse1))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_1010| 4) (= (+ |v_#pthreadsForks_415| 1) |v_#pthreadsForks_414|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_981| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_981|))) InVars {~q_back~0=v_~q_back~0_1765, #pthreadsForks=|v_#pthreadsForks_415|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_184|, #memory_int=|v_#memory_int_1137|, ~N~0=v_~N~0_606, ~q~0.base=v_~q~0.base_773, ~n~0=v_~n~0_760, ~q~0.offset=v_~q~0.offset_773, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_187|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_388|, ~q_back~0=v_~q_back~0_1763, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_406|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_184|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_728|, ~N~0=v_~N~0_606, ~q~0.base=v_~q~0.base_773, ~q~0.offset=v_~q~0.offset_773, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_981|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_307|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_732|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_354|, #pthreadsForks=|v_#pthreadsForks_414|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_728|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1010|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_406|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_981|, #memory_int=|v_#memory_int_1136|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_262|, ~n~0=v_~n~0_760, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_187|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_388|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_#t~post1#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:52:42,451 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:52:42,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5419 [2022-12-06 05:52:42,452 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 2224 transitions, 87575 flow [2022-12-06 05:52:42,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:42,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:42,452 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:42,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-12-06 05:52:42,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:42,658 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1865703256, now seen corresponding path program 1 times [2022-12-06 05:52:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:42,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133181698] [2022-12-06 05:52:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133181698] [2022-12-06 05:52:43,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133181698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673837871] [2022-12-06 05:52:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:43,091 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:52:43,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-12-06 05:52:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:43,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:52:43,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:43,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:43,535 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 05:52:43,535 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 27 treesize of output 16 [2022-12-06 05:52:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:43,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673837871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:43,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:43,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-06 05:52:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461967389] [2022-12-06 05:52:43,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:43,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:52:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:52:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:52:43,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 93 [2022-12-06 05:52:43,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 2224 transitions, 87575 flow. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:43,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:43,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 93 [2022-12-06 05:52:43,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:55,683 INFO L130 PetriNetUnfolder]: 7711/13835 cut-off events. [2022-12-06 05:52:55,684 INFO L131 PetriNetUnfolder]: For 1196464/1196534 co-relation queries the response was YES. [2022-12-06 05:52:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214101 conditions, 13835 events. 7711/13835 cut-off events. For 1196464/1196534 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 114415 event pairs, 1070 based on Foata normal form. 142/13961 useless extension candidates. Maximal degree in co-relation 213448. Up to 9595 conditions per place. [2022-12-06 05:52:55,897 INFO L137 encePairwiseOnDemand]: 40/93 looper letters, 1884 selfloop transitions, 717 changer transitions 1/2603 dead transitions. [2022-12-06 05:52:55,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 2603 transitions, 103722 flow [2022-12-06 05:52:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 05:52:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 05:52:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-12-06 05:52:55,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11779081133919844 [2022-12-06 05:52:55,899 INFO L175 Difference]: Start difference. First operand has 501 places, 2224 transitions, 87575 flow. Second operand 22 states and 241 transitions. [2022-12-06 05:52:55,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 2603 transitions, 103722 flow [2022-12-06 05:53:10,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 2603 transitions, 96624 flow, removed 3436 selfloop flow, removed 10 redundant places. [2022-12-06 05:53:10,871 INFO L231 Difference]: Finished difference. Result has 519 places, 2277 transitions, 85179 flow [2022-12-06 05:53:10,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=80954, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=662, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=85179, PETRI_PLACES=519, PETRI_TRANSITIONS=2277} [2022-12-06 05:53:10,873 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 498 predicate places. [2022-12-06 05:53:10,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:10,873 INFO L89 Accepts]: Start accepts. Operand has 519 places, 2277 transitions, 85179 flow [2022-12-06 05:53:10,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:53:10,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:53:10,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 519 places, 2277 transitions, 85179 flow [2022-12-06 05:53:10,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 518 places, 2277 transitions, 85179 flow [2022-12-06 05:53:13,246 INFO L130 PetriNetUnfolder]: 2037/5650 cut-off events. [2022-12-06 05:53:13,246 INFO L131 PetriNetUnfolder]: For 484332/486717 co-relation queries the response was YES. [2022-12-06 05:53:13,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77897 conditions, 5650 events. 2037/5650 cut-off events. For 484332/486717 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 59938 event pairs, 23 based on Foata normal form. 664/6296 useless extension candidates. Maximal degree in co-relation 77446. Up to 2143 conditions per place. [2022-12-06 05:53:13,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 518 places, 2277 transitions, 85179 flow [2022-12-06 05:53:13,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 7732 [2022-12-06 05:53:13,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~q_back~0_In_4 v_~n~0_In_6) (<= 0 v_~q_back~0_In_4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_3| v_~N~0_In_5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~q_back~0_Out_20 (+ v_~q_back~0_In_4 1)) (= (ite (= (select (select |v_#memory_int_In_15| 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|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~q_back~0=v_~q_back~0_In_4, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_15|, ~N~0=v_~N~0_In_5, ~q~0.base=v_~q~0.base_In_4, ~n~0=v_~n~0_In_6, ~q~0.offset=v_~q~0.offset_In_4} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~q_back~0=v_~q_back~0_Out_20, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_Out_4|, ~N~0=v_~N~0_In_5, ~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_15|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} 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, thread1Thread1of1ForFork0_#res#1.base] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:53:14,046 WARN L322 ript$VariableManager]: TermVariable LBE248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:53:14,046 WARN L322 ript$VariableManager]: TermVariable LBE242 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:53:14,046 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:53:14,046 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:53:14,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [936] $Ultimate##0-->L47-4: Formula: (let ((.cse0 (select |v_#memory_int_1061| v_~q~0.base_719)) (.cse1 (* v_~q_back~0_1612 4))) (and (= (ite (= (select .cse0 (+ (- 4) (* v_~q_back~0_1610 4) v_~q~0.offset_719)) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_883|) (= (select .cse0 (+ (* v_~q_front~0_1511 4) v_~q~0.offset_719)) |v_thread2Thread1of1ForFork1_~j~0#1_985|) (not (= (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_719)) 1) 1 0) 0)) (= v_~q_front~0_1510 (+ v_~q_front~0_1511 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_902| 0)) (not (= (ite (= (select .cse0 (+ .cse1 12 v_~q~0.offset_719)) 1) 1 0) 0)) (not (= (ite (and (<= 0 v_~q_back~0_1612) (< v_~q_back~0_1612 v_~n~0_706)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_902| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_902|) (< |v_thread1Thread1of1ForFork0_~i~0#1_915| (+ v_~N~0_558 1)) (= (+ v_~s~0_1452 |v_thread2Thread1of1ForFork1_~j~0#1_985|) v_~s~0_1451) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_985| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_915| 5) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_883| 0)) (not (= 0 (ite (= (select .cse0 (+ .cse1 v_~q~0.offset_719 4)) 1) 1 0))) (= (+ 5 v_~q_back~0_1612) v_~q_back~0_1610) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_883| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_883|) (not (= (ite (= (select .cse0 (+ .cse1 8 v_~q~0.offset_719)) 1) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_902| (ite (and (<= 0 v_~q_front~0_1511) (< v_~q_front~0_1511 (+ 3 v_~q_back~0_1612)) (< v_~q_front~0_1511 v_~n~0_706)) 1 0)) (not (= (ite (and (<= 1 v_~q_back~0_1610) (< v_~q_back~0_1610 (+ v_~n~0_706 1))) 1 0) 0)))) InVars {~q_back~0=v_~q_back~0_1612, #memory_int=|v_#memory_int_1061|, ~N~0=v_~N~0_558, ~q~0.base=v_~q~0.base_719, ~n~0=v_~n~0_706, ~q~0.offset=v_~q~0.offset_719, ~s~0=v_~s~0_1452, ~q_front~0=v_~q_front~0_1511} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_985|, ~q_back~0=v_~q_back~0_1610, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_902|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_647|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_902|, ~N~0=v_~N~0_558, ~q~0.base=v_~q~0.base_719, ~q~0.offset=v_~q~0.offset_719, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_902|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_902|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_883|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_651|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_647|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_915|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_883|, #memory_int=|v_#memory_int_1061|, ~n~0=v_~n~0_706, ~s~0=v_~s~0_1451, ~q_front~0=v_~q_front~0_1510} 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, ~s~0, ~q_front~0] and [482] L65-2-->L65-2: Formula: (and (= (ite (and (<= 0 v_~q_front~0_83) (< v_~q_front~0_83 v_~n~0_71) (< v_~q_front~0_83 v_~q_back~0_120)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (= (+ v_~q_front~0_83 1) v_~q_front~0_82) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_31| 0)) (= |v_thread2Thread1of1ForFork1_~j~0#1_31| (select (select |v_#memory_int_88| v_~q~0.base_68) (+ v_~q~0.offset_68 (* v_~q_front~0_83 4)))) (= (+ v_~s~0_38 |v_thread2Thread1of1ForFork1_~j~0#1_31|) v_~s~0_37) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| 0))) InVars {~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_38, ~q_front~0=v_~q_front~0_83} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_31|, ~q_back~0=v_~q_back~0_120, #memory_int=|v_#memory_int_88|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_23|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_71, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_23|, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_37, ~q_front~0=v_~q_front~0_82} 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, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] [2022-12-06 05:53:14,996 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:53:14,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4123 [2022-12-06 05:53:14,996 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 2276 transitions, 85293 flow [2022-12-06 05:53:14,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:53:14,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:53:14,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:15,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-12-06 05:53:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2022-12-06 05:53:15,197 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:53:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:53:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1849625933, now seen corresponding path program 1 times [2022-12-06 05:53:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:53:15,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29777412] [2022-12-06 05:53:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:53:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:53:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:53:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29777412] [2022-12-06 05:53:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29777412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:53:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252190934] [2022-12-06 05:53:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:53:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:53:15,993 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:53:15,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-12-06 05:53:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:16,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:53:16,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:53:16,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:53:16,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 05:53:16,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:53:16,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 16 [2022-12-06 05:53:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:53:16,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:53:16,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:53:16,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 205 treesize of output 247 [2022-12-06 05:53:16,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:53:16,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 112 [2022-12-06 05:53:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:53:17,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252190934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:53:17,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:53:17,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:53:17,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370291871] [2022-12-06 05:53:17,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:53:17,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:53:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:53:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:53:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:53:17,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 95 [2022-12-06 05:53:17,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 2276 transitions, 85293 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:53:17,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:53:17,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 95 [2022-12-06 05:53:17,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:53:29,233 INFO L130 PetriNetUnfolder]: 7831/14055 cut-off events. [2022-12-06 05:53:29,233 INFO L131 PetriNetUnfolder]: For 1060987/1060998 co-relation queries the response was YES. [2022-12-06 05:53:29,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208778 conditions, 14055 events. 7831/14055 cut-off events. For 1060987/1060998 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 115623 event pairs, 2208 based on Foata normal form. 12/14051 useless extension candidates. Maximal degree in co-relation 207881. Up to 13448 conditions per place. [2022-12-06 05:53:29,449 INFO L137 encePairwiseOnDemand]: 35/95 looper letters, 2137 selfloop transitions, 222 changer transitions 6/2366 dead transitions. [2022-12-06 05:53:29,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 2366 transitions, 92716 flow [2022-12-06 05:53:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:53:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:53:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2022-12-06 05:53:29,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12180451127819548 [2022-12-06 05:53:29,450 INFO L175 Difference]: Start difference. First operand has 517 places, 2276 transitions, 85293 flow. Second operand 14 states and 162 transitions. [2022-12-06 05:53:29,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 2366 transitions, 92716 flow [2022-12-06 05:53:43,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 2366 transitions, 92223 flow, removed 167 selfloop flow, removed 8 redundant places. Received shutdown request... [2022-12-06 05:53:43,910 INFO L231 Difference]: Finished difference. Result has 527 places, 2312 transitions, 86845 flow [2022-12-06 05:53:43,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=84848, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=86845, PETRI_PLACES=527, PETRI_TRANSITIONS=2312} [2022-12-06 05:53:43,911 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 506 predicate places. [2022-12-06 05:53:43,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:43,911 INFO L89 Accepts]: Start accepts. Operand has 527 places, 2312 transitions, 86845 flow [2022-12-06 05:53:43,916 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:53:43,917 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:53:43,924 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:53:43,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-12-06 05:53:44,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2022-12-06 05:53:44,130 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Accepts. [2022-12-06 05:53:44,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:53:44,132 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:53:44,132 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:44,134 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:53:44,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:53:44,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:53:44 BasicIcfg [2022-12-06 05:53:44,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:53:44,136 INFO L158 Benchmark]: Toolchain (without parser) took 828695.84ms. Allocated memory was 172.0MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 148.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 05:53:44,136 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:53:44,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.60ms. Allocated memory is still 172.0MB. Free memory was 148.2MB in the beginning and 136.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:53:44,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.08ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:53:44,136 INFO L158 Benchmark]: Boogie Preprocessor took 36.54ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 132.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:53:44,136 INFO L158 Benchmark]: RCFGBuilder took 454.63ms. Allocated memory is still 172.0MB. Free memory was 132.5MB in the beginning and 109.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 05:53:44,136 INFO L158 Benchmark]: TraceAbstraction took 827984.43ms. Allocated memory was 172.0MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 108.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 05:53:44,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.60ms. Allocated memory is still 172.0MB. Free memory was 148.2MB in the beginning and 136.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.08ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.54ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 132.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 454.63ms. Allocated memory is still 172.0MB. Free memory was 132.5MB in the beginning and 109.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 827984.43ms. Allocated memory was 172.0MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 108.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 110 PlacesBefore, 21 PlacesAfterwards, 114 TransitionsBefore, 17 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 19 ConcurrentYvCompositions, 7 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 317, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 292, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 292, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 292, unknown conditional: 0, unknown unconditional: 292] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 459, Positive conditional cache size: 0, Positive unconditional cache size: 459, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.7s, 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.2s, 26 PlacesBefore, 26 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 5, independent: 5, independent conditional: 1, independent unconditional: 4, 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: 15, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 1, Positive unconditional cache size: 4, 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, 27 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 82 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): 5, Positive cache size: 5, Positive conditional cache size: 1, Positive unconditional cache size: 4, 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.9s, 30 PlacesBefore, 29 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 82 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): 5, Positive cache size: 5, Positive conditional cache size: 1, Positive unconditional cache size: 4, 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.3s, 36 PlacesBefore, 36 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 2, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 5, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 13, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 38 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 18, Positive conditional cache size: 14, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 42 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 27, Positive conditional cache size: 23, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 43 PlacesBefore, 43 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 156 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): 31, Positive cache size: 27, Positive conditional cache size: 23, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 46 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 164 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): 40, Positive cache size: 36, Positive conditional cache size: 32, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 39, Positive conditional cache size: 35, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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: 2.4s, 45 PlacesBefore, 45 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 168 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): 43, Positive cache size: 39, Positive conditional cache size: 35, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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.9s, 68 PlacesBefore, 62 PlacesAfterwards, 84 TransitionsBefore, 78 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 53, Positive conditional cache size: 49, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 62 PlacesBefore, 62 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 292 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): 57, Positive cache size: 53, Positive conditional cache size: 49, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 67 PlacesBefore, 66 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 82, Positive conditional cache size: 78, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 302 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): 86, Positive cache size: 82, Positive conditional cache size: 78, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 69 PlacesBefore, 68 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 306 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): 89, Positive cache size: 85, Positive conditional cache size: 81, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 71 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 316 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): 108, Positive cache size: 104, Positive conditional cache size: 100, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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.8s, 83 PlacesBefore, 83 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 219, Positive conditional cache size: 215, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 82 PlacesBefore, 82 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 346 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): 223, Positive cache size: 219, Positive conditional cache size: 215, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 4, 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, 89 PlacesBefore, 88 PlacesAfterwards, 120 TransitionsBefore, 119 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 275, Positive conditional cache size: 271, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 486 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): 282, Positive cache size: 275, Positive conditional cache size: 271, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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.0s, 108 PlacesBefore, 108 PlacesAfterwards, 144 TransitionsBefore, 144 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 282, Positive conditional cache size: 278, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 102 PlacesBefore, 102 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 454 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): 289, Positive cache size: 282, Positive conditional cache size: 278, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 113 PlacesBefore, 113 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 283, Positive conditional cache size: 279, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 110 PlacesBefore, 110 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 496 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): 290, Positive cache size: 283, Positive conditional cache size: 279, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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.6s, 93 PlacesBefore, 92 PlacesAfterwards, 108 TransitionsBefore, 107 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 16, 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: 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] , 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: 16, independent: 11, independent conditional: 11, 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 89 PlacesBefore, 89 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 372 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 90 PlacesBefore, 90 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 382 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 92 PlacesBefore, 92 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 390 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): 295, Positive cache size: 288, Positive conditional cache size: 284, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 107 PlacesBefore, 106 PlacesAfterwards, 129 TransitionsBefore, 128 TransitionsAfterwards, 430 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): 298, Positive cache size: 291, Positive conditional cache size: 287, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 114 PlacesBefore, 111 PlacesAfterwards, 132 TransitionsBefore, 129 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 325, Positive conditional cache size: 321, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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.8s, 123 PlacesBefore, 122 PlacesAfterwards, 153 TransitionsBefore, 152 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 119 PlacesBefore, 119 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 486 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): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 128 PlacesBefore, 128 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 504 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): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 132 PlacesBefore, 132 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 522 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): 335, Positive cache size: 328, Positive conditional cache size: 324, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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.4s, 122 PlacesBefore, 118 PlacesAfterwards, 113 TransitionsBefore, 109 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 422, Positive conditional cache size: 418, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 109 PlacesBefore, 109 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 340 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): 429, Positive cache size: 422, Positive conditional cache size: 418, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 111 PlacesBefore, 111 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 428, Positive conditional cache size: 424, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 117 PlacesBefore, 116 PlacesAfterwards, 114 TransitionsBefore, 113 TransitionsAfterwards, 336 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 471, Positive conditional cache size: 467, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 111 PlacesBefore, 111 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 472, Positive conditional cache size: 468, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 106 PlacesBefore, 106 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 290 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): 479, Positive cache size: 472, Positive conditional cache size: 468, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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.1s, 109 PlacesBefore, 108 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 473, Positive conditional cache size: 469, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 112 PlacesBefore, 113 PlacesAfterwards, 95 TransitionsBefore, 96 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 476, Positive conditional cache size: 472, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 110 PlacesBefore, 110 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 518, Positive conditional cache size: 514, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 123 PlacesBefore, 122 PlacesAfterwards, 102 TransitionsBefore, 101 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 564, Positive conditional cache size: 560, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 113 PlacesBefore, 113 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 298 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): 571, Positive cache size: 564, Positive conditional cache size: 560, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 114 PlacesBefore, 114 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 296 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): 571, Positive cache size: 564, Positive conditional cache size: 560, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 128 PlacesBefore, 121 PlacesAfterwards, 109 TransitionsBefore, 103 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 757, Positive conditional cache size: 753, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 117 PlacesBefore, 116 PlacesAfterwards, 101 TransitionsBefore, 100 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 837, Positive cache size: 830, Positive conditional cache size: 826, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 113 PlacesBefore, 113 PlacesAfterwards, 99 TransitionsBefore, 100 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 6, independent conditional: 6, 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): 840, Positive cache size: 833, Positive conditional cache size: 829, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 109 PlacesBefore, 109 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 833, Positive conditional cache size: 829, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 106 PlacesBefore, 106 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 843, Positive cache size: 836, Positive conditional cache size: 832, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 108 PlacesBefore, 108 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 280 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): 843, Positive cache size: 836, Positive conditional cache size: 832, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 84 PlacesBefore, 84 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 260 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): 843, Positive cache size: 836, Positive conditional cache size: 832, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 86 PlacesBefore, 84 PlacesAfterwards, 100 TransitionsBefore, 98 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 80 PlacesBefore, 80 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 360 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): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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: 5.3s, 93 PlacesBefore, 93 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 94 PlacesBefore, 94 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 372 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): 986, Positive cache size: 979, Positive conditional cache size: 975, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 91 PlacesBefore, 91 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 982, Positive conditional cache size: 978, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 103 PlacesBefore, 102 PlacesAfterwards, 146 TransitionsBefore, 145 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 6, independent: 1, independent conditional: 1, 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): 994, Positive cache size: 987, Positive conditional cache size: 983, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 101 PlacesBefore, 101 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 468 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): 994, Positive cache size: 987, Positive conditional cache size: 983, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 121 PlacesBefore, 121 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 578 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): 994, Positive cache size: 987, Positive conditional cache size: 983, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 141 PlacesBefore, 140 PlacesAfterwards, 203 TransitionsBefore, 202 TransitionsAfterwards, 624 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: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 991, Positive conditional cache size: 987, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 137 PlacesBefore, 137 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 586 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): 998, Positive cache size: 991, Positive conditional cache size: 987, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, 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, 132 PlacesBefore, 132 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 556 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): 998, Positive cache size: 991, Positive conditional cache size: 987, Positive unconditional cache size: 4, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 130 PlacesBefore, 130 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 995, Positive conditional cache size: 991, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 143 PlacesBefore, 141 PlacesAfterwards, 200 TransitionsBefore, 198 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1008, Positive cache size: 996, Positive conditional cache size: 992, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 150 PlacesBefore, 145 PlacesAfterwards, 211 TransitionsBefore, 206 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1336, Positive conditional cache size: 1332, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 142 PlacesBefore, 142 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 678 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): 1348, Positive cache size: 1336, Positive conditional cache size: 1332, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 143 PlacesBefore, 143 PlacesAfterwards, 231 TransitionsBefore, 231 TransitionsAfterwards, 708 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): 1348, Positive cache size: 1336, Positive conditional cache size: 1332, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 5.5s, 148 PlacesBefore, 146 PlacesAfterwards, 235 TransitionsBefore, 233 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1676, Positive conditional cache size: 1672, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 166 PlacesBefore, 165 PlacesAfterwards, 267 TransitionsBefore, 266 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 2, independent conditional: 2, 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 163 PlacesBefore, 163 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 822 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 163 PlacesBefore, 163 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 820 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 166 PlacesBefore, 166 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 874 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): 1695, Positive cache size: 1683, Positive conditional cache size: 1679, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 170 PlacesBefore, 170 PlacesAfterwards, 321 TransitionsBefore, 321 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1698, Positive cache size: 1686, Positive conditional cache size: 1682, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 178 PlacesBefore, 178 PlacesAfterwards, 325 TransitionsBefore, 325 TransitionsAfterwards, 1056 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1699, Positive cache size: 1687, Positive conditional cache size: 1683, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.9s, 189 PlacesBefore, 188 PlacesAfterwards, 335 TransitionsBefore, 333 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1798, Positive cache size: 1786, Positive conditional cache size: 1782, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 181 PlacesBefore, 181 PlacesAfterwards, 330 TransitionsBefore, 330 TransitionsAfterwards, 1066 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): 1798, Positive cache size: 1786, Positive conditional cache size: 1782, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 186 PlacesBefore, 186 PlacesAfterwards, 340 TransitionsBefore, 340 TransitionsAfterwards, 1094 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 186 PlacesBefore, 186 PlacesAfterwards, 337 TransitionsBefore, 337 TransitionsAfterwards, 1088 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 185 PlacesBefore, 185 PlacesAfterwards, 337 TransitionsBefore, 337 TransitionsAfterwards, 1088 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 190 PlacesBefore, 190 PlacesAfterwards, 339 TransitionsBefore, 339 TransitionsAfterwards, 1096 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 194 PlacesBefore, 194 PlacesAfterwards, 344 TransitionsBefore, 344 TransitionsAfterwards, 1110 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): 1800, Positive cache size: 1788, Positive conditional cache size: 1784, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 208 PlacesBefore, 206 PlacesAfterwards, 351 TransitionsBefore, 349 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1902, Positive cache size: 1890, Positive conditional cache size: 1886, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 208 PlacesBefore, 208 PlacesAfterwards, 356 TransitionsBefore, 356 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 6, independent conditional: 6, 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): 1905, Positive cache size: 1893, Positive conditional cache size: 1889, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.8s, 212 PlacesBefore, 210 PlacesAfterwards, 357 TransitionsBefore, 355 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1913, Positive cache size: 1901, Positive conditional cache size: 1897, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 201 PlacesBefore, 201 PlacesAfterwards, 363 TransitionsBefore, 363 TransitionsAfterwards, 1174 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): 1913, Positive cache size: 1901, Positive conditional cache size: 1897, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 204 PlacesBefore, 202 PlacesAfterwards, 365 TransitionsBefore, 363 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2025, Positive cache size: 2013, Positive conditional cache size: 2009, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 202 PlacesBefore, 202 PlacesAfterwards, 379 TransitionsBefore, 379 TransitionsAfterwards, 1210 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): 2025, Positive cache size: 2013, Positive conditional cache size: 2009, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 209 PlacesBefore, 208 PlacesAfterwards, 380 TransitionsBefore, 379 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 2014, Positive conditional cache size: 2010, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 213 PlacesBefore, 211 PlacesAfterwards, 381 TransitionsBefore, 379 TransitionsAfterwards, 1218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2036, Positive cache size: 2024, Positive conditional cache size: 2020, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 4.1s, 217 PlacesBefore, 213 PlacesAfterwards, 387 TransitionsBefore, 383 TransitionsAfterwards, 1230 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2043, Positive cache size: 2031, Positive conditional cache size: 2027, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 208 PlacesBefore, 208 PlacesAfterwards, 391 TransitionsBefore, 391 TransitionsAfterwards, 1224 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): 2043, Positive cache size: 2031, Positive conditional cache size: 2027, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.0s, 211 PlacesBefore, 209 PlacesAfterwards, 392 TransitionsBefore, 390 TransitionsAfterwards, 1230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2149, Positive conditional cache size: 2145, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 208 PlacesBefore, 208 PlacesAfterwards, 481 TransitionsBefore, 481 TransitionsAfterwards, 1544 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): 2161, Positive cache size: 2149, Positive conditional cache size: 2145, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.6s, 214 PlacesBefore, 214 PlacesAfterwards, 496 TransitionsBefore, 496 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 219 PlacesBefore, 219 PlacesAfterwards, 498 TransitionsBefore, 498 TransitionsAfterwards, 1604 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): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 234 PlacesBefore, 234 PlacesAfterwards, 537 TransitionsBefore, 537 TransitionsAfterwards, 1762 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): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 234 PlacesBefore, 234 PlacesAfterwards, 535 TransitionsBefore, 535 TransitionsAfterwards, 1756 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): 2165, Positive cache size: 2153, Positive conditional cache size: 2149, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.6s, 242 PlacesBefore, 242 PlacesAfterwards, 541 TransitionsBefore, 541 TransitionsAfterwards, 1766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2169, Positive cache size: 2157, Positive conditional cache size: 2153, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 241 PlacesBefore, 241 PlacesAfterwards, 538 TransitionsBefore, 538 TransitionsAfterwards, 1752 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): 2169, Positive cache size: 2157, Positive conditional cache size: 2153, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.1s, 252 PlacesBefore, 252 PlacesAfterwards, 564 TransitionsBefore, 564 TransitionsAfterwards, 1840 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2170, Positive cache size: 2158, Positive conditional cache size: 2154, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 253 PlacesBefore, 252 PlacesAfterwards, 560 TransitionsBefore, 559 TransitionsAfterwards, 1830 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2171, Positive cache size: 2159, Positive conditional cache size: 2155, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 255 PlacesBefore, 255 PlacesAfterwards, 583 TransitionsBefore, 583 TransitionsAfterwards, 1936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 260 PlacesBefore, 260 PlacesAfterwards, 586 TransitionsBefore, 586 TransitionsAfterwards, 1928 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): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 260 PlacesBefore, 260 PlacesAfterwards, 584 TransitionsBefore, 584 TransitionsAfterwards, 1922 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): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 261 PlacesBefore, 261 PlacesAfterwards, 608 TransitionsBefore, 608 TransitionsAfterwards, 2030 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): 2174, Positive cache size: 2162, Positive conditional cache size: 2158, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 276 PlacesBefore, 275 PlacesAfterwards, 705 TransitionsBefore, 704 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2179, Positive cache size: 2167, Positive conditional cache size: 2163, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 289 PlacesBefore, 288 PlacesAfterwards, 792 TransitionsBefore, 791 TransitionsAfterwards, 2710 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 2179, Positive cache size: 2167, Positive conditional cache size: 2163, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 298 PlacesBefore, 297 PlacesAfterwards, 791 TransitionsBefore, 790 TransitionsAfterwards, 2708 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): 2184, Positive cache size: 2172, Positive conditional cache size: 2168, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 341 PlacesBefore, 341 PlacesAfterwards, 1079 TransitionsBefore, 1079 TransitionsAfterwards, 3682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2309, Positive cache size: 2297, Positive conditional cache size: 2293, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 334 PlacesBefore, 334 PlacesAfterwards, 1075 TransitionsBefore, 1075 TransitionsAfterwards, 3676 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): 2309, Positive cache size: 2297, Positive conditional cache size: 2293, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.4s, 341 PlacesBefore, 341 PlacesAfterwards, 1106 TransitionsBefore, 1106 TransitionsAfterwards, 3734 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2315, Positive cache size: 2303, Positive conditional cache size: 2299, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 338 PlacesBefore, 338 PlacesAfterwards, 1106 TransitionsBefore, 1106 TransitionsAfterwards, 3726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2318, Positive cache size: 2306, Positive conditional cache size: 2302, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.7s, 362 PlacesBefore, 355 PlacesAfterwards, 1141 TransitionsBefore, 1134 TransitionsAfterwards, 3924 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 37, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3374, Positive cache size: 3362, Positive conditional cache size: 3358, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 366 PlacesBefore, 366 PlacesAfterwards, 1198 TransitionsBefore, 1198 TransitionsAfterwards, 4134 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): 3374, Positive cache size: 3362, Positive conditional cache size: 3358, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.8s, 373 PlacesBefore, 373 PlacesAfterwards, 1186 TransitionsBefore, 1186 TransitionsAfterwards, 4078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3379, Positive cache size: 3367, Positive conditional cache size: 3363, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 363 PlacesBefore, 363 PlacesAfterwards, 1505 TransitionsBefore, 1505 TransitionsAfterwards, 5194 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3380, Positive cache size: 3368, Positive conditional cache size: 3364, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 2.5s, 366 PlacesBefore, 366 PlacesAfterwards, 1508 TransitionsBefore, 1508 TransitionsAfterwards, 5196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3388, Positive cache size: 3376, Positive conditional cache size: 3372, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.9s, 363 PlacesBefore, 363 PlacesAfterwards, 1504 TransitionsBefore, 1504 TransitionsAfterwards, 5180 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3392, Positive cache size: 3380, Positive conditional cache size: 3376, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 362 PlacesBefore, 362 PlacesAfterwards, 1500 TransitionsBefore, 1500 TransitionsAfterwards, 5162 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3397, Positive cache size: 3385, Positive conditional cache size: 3381, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 368 PlacesBefore, 368 PlacesAfterwards, 1489 TransitionsBefore, 1489 TransitionsAfterwards, 5104 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): 3397, Positive cache size: 3385, Positive conditional cache size: 3381, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 367 PlacesBefore, 367 PlacesAfterwards, 1489 TransitionsBefore, 1489 TransitionsAfterwards, 5098 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): 3397, Positive cache size: 3385, Positive conditional cache size: 3381, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 370 PlacesBefore, 370 PlacesAfterwards, 1491 TransitionsBefore, 1491 TransitionsAfterwards, 5102 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): 3397, Positive cache size: 3385, Positive conditional cache size: 3381, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 384 PlacesBefore, 383 PlacesAfterwards, 1494 TransitionsBefore, 1493 TransitionsAfterwards, 5088 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3667, Positive cache size: 3655, Positive conditional cache size: 3651, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 379 PlacesBefore, 379 PlacesAfterwards, 1494 TransitionsBefore, 1494 TransitionsAfterwards, 5084 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): 3667, Positive cache size: 3655, Positive conditional cache size: 3651, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.0s, 391 PlacesBefore, 391 PlacesAfterwards, 1494 TransitionsBefore, 1494 TransitionsAfterwards, 5084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3801, Positive cache size: 3789, Positive conditional cache size: 3785, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 385 PlacesBefore, 385 PlacesAfterwards, 1491 TransitionsBefore, 1491 TransitionsAfterwards, 5078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3805, Positive cache size: 3793, Positive conditional cache size: 3789, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 401 PlacesBefore, 398 PlacesAfterwards, 1544 TransitionsBefore, 1541 TransitionsAfterwards, 5298 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3970, Positive cache size: 3958, Positive conditional cache size: 3954, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 403 PlacesBefore, 403 PlacesAfterwards, 1562 TransitionsBefore, 1562 TransitionsAfterwards, 5330 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): 3970, Positive cache size: 3958, Positive conditional cache size: 3954, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 405 PlacesBefore, 405 PlacesAfterwards, 1561 TransitionsBefore, 1561 TransitionsAfterwards, 5328 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): 3970, Positive cache size: 3958, Positive conditional cache size: 3954, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 418 PlacesBefore, 418 PlacesAfterwards, 1564 TransitionsBefore, 1564 TransitionsAfterwards, 5332 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): 3970, Positive cache size: 3958, Positive conditional cache size: 3954, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 415 PlacesBefore, 415 PlacesAfterwards, 1672 TransitionsBefore, 1672 TransitionsAfterwards, 5632 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): 3970, Positive cache size: 3958, Positive conditional cache size: 3954, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.0s, 427 PlacesBefore, 426 PlacesAfterwards, 1722 TransitionsBefore, 1721 TransitionsAfterwards, 5746 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3974, Positive cache size: 3962, Positive conditional cache size: 3958, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 2.4s, 440 PlacesBefore, 439 PlacesAfterwards, 1735 TransitionsBefore, 1734 TransitionsAfterwards, 5784 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3982, Positive cache size: 3970, Positive conditional cache size: 3966, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 433 PlacesBefore, 433 PlacesAfterwards, 1732 TransitionsBefore, 1732 TransitionsAfterwards, 5768 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): 3982, Positive cache size: 3970, Positive conditional cache size: 3966, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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.9s, 434 PlacesBefore, 433 PlacesAfterwards, 1733 TransitionsBefore, 1732 TransitionsAfterwards, 5774 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): 3985, Positive cache size: 3973, Positive conditional cache size: 3969, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 432 PlacesBefore, 432 PlacesAfterwards, 1731 TransitionsBefore, 1731 TransitionsAfterwards, 5766 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): 3985, Positive cache size: 3973, Positive conditional cache size: 3969, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 444 PlacesBefore, 444 PlacesAfterwards, 1782 TransitionsBefore, 1782 TransitionsAfterwards, 5998 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): 3985, Positive cache size: 3973, Positive conditional cache size: 3969, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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, 459 PlacesBefore, 459 PlacesAfterwards, 1791 TransitionsBefore, 1791 TransitionsAfterwards, 6012 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3986, Positive cache size: 3974, Positive conditional cache size: 3970, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, 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: 2.6s, 501 PlacesBefore, 501 PlacesAfterwards, 2224 TransitionsBefore, 2224 TransitionsAfterwards, 7484 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4143, Positive cache size: 4131, Positive conditional cache size: 4127, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 518 PlacesBefore, 517 PlacesAfterwards, 2277 TransitionsBefore, 2276 TransitionsAfterwards, 7732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4152, Positive cache size: 4140, Positive conditional cache size: 4136, Positive unconditional cache size: 4, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Accepts. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Accepts. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Accepts. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 134 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 827.9s, OverallIterations: 146, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 525.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 5650 SdHoareTripleChecker+Valid, 46.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5650 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 40.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 200 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 5426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67865 IncrementalHoareTripleChecker+Invalid, 73511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5426 mSolverCounterUnsat, 1 mSDtfsCounter, 67865 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3782 GetRequests, 1739 SyntacticMatches, 103 SemanticMatches, 1940 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 4581 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87575occurred in iteration=144, InterpolantAutomatonStates: 1333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 100.6s InterpolantComputationTime, 3365 NumberOfCodeBlocks, 3363 NumberOfCodeBlocksAsserted, 259 NumberOfCheckSat, 4219 ConstructedInterpolants, 32 QuantifiedInterpolants, 103730 SizeOfPredicates, 1536 NumberOfNonLiveVariables, 23556 ConjunctsInSsa, 3469 ConjunctsInUnsatCore, 334 InterpolantComputations, 60 PerfectInterpolantSequences, 61/667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown