/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-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:52:11,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:52:11,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:52:11,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:52:11,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:52:11,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:52:11,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:52:11,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:52:11,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:52:11,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:52:11,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:52:11,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:52:11,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:52:11,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:52:11,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:52:11,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:52:11,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:52:11,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:52:11,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:52:11,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:52:11,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:52:11,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:52:11,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:52:11,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:52:11,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:52:11,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:52:11,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:52:11,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:52:11,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:52:11,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:52:11,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:52:11,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:52:11,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:52:11,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:52:11,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:52:11,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:52:11,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:52:11,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:52:11,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:52:11,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:52:11,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:52:11,264 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-13 10:52:11,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:52:11,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:52:11,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:52:11,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:52:11,292 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:52:11,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:52:11,293 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:52:11,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:52:11,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:52:11,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:52:11,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:52:11,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:52:11,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:52:11,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:52:11,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:52:11,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:52:11,296 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-13 10:52:11,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:52:11,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:52:11,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:52:11,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:52:11,556 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:52:11,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-13 10:52:12,510 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:52:12,686 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:52:12,686 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-13 10:52:12,691 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2550f840f/323a2062821745719ada5245a9a32df5/FLAG382326b7b [2022-12-13 10:52:12,709 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2550f840f/323a2062821745719ada5245a9a32df5 [2022-12-13 10:52:12,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:52:12,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:52:12,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:52:12,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:52:12,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:52:12,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:12,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce35d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12, skipping insertion in model container [2022-12-13 10:52:12,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:12,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:52:12,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:52:12,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,882 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-13 10:52:12,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:52:12,902 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:52:12,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:52:12,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:52:12,933 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-13 10:52:12,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:52:12,951 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:52:12,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12 WrapperNode [2022-12-13 10:52:12,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:52:12,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:52:12,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:52:12,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:52:12,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:12,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,000 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-13 10:52:13,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:52:13,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:52:13,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:52:13,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:52:13,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,032 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:52:13,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:52:13,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:52:13,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:52:13,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (1/1) ... [2022-12-13 10:52:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:52:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:13,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:52:13,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:52:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:52:13,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:52:13,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:52:13,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:52:13,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:52:13,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:52:13,085 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:52:13,219 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:52:13,220 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:52:13,434 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:52:13,479 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:52:13,479 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 10:52:13,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:52:13 BoogieIcfgContainer [2022-12-13 10:52:13,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:52:13,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:52:13,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:52:13,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:52:13,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:52:12" (1/3) ... [2022-12-13 10:52:13,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5213f999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:52:13, skipping insertion in model container [2022-12-13 10:52:13,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:52:12" (2/3) ... [2022-12-13 10:52:13,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5213f999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:52:13, skipping insertion in model container [2022-12-13 10:52:13,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:52:13" (3/3) ... [2022-12-13 10:52:13,486 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-13 10:52:13,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:52:13,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:52:13,499 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:52:13,565 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 10:52:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-13 10:52:13,676 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-13 10:52:13,677 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:52:13,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 10:52:13,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-13 10:52:13,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-13 10:52:13,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:13,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-13 10:52:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-13 10:52:13,766 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-13 10:52:13,767 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:52:13,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 10:52:13,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-13 10:52:13,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 10:52:18,647 INFO L241 LiptonReduction]: Total number of compositions: 140 [2022-12-13 10:52:18,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:52:18,662 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;@18779eca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:52:18,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 10:52:18,665 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-13 10:52:18,666 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:52:18,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:18,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:18,666 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-13 10:52:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-13 10:52:18,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:18,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440359285] [2022-12-13 10:52:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:19,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:19,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440359285] [2022-12-13 10:52:19,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440359285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:19,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:52:19,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:52:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994889420] [2022-12-13 10:52:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:19,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:52:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:19,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:52:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:52:19,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:52:19,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) 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-13 10:52:19,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:19,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:52:19,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:19,169 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-13 10:52:19,169 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 10:52:19,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-13 10:52:19,171 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-13 10:52:19,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-13 10:52:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:52:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:52:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 10:52:19,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-13 10:52:19,181 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-13 10:52:19,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-13 10:52:19,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 10:52:19,184 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-13 10:52:19,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-13 10:52:19,188 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-13 10:52:19,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:19,189 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-13 10:52:19,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:19,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:19,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-13 10:52:19,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-13 10:52:19,194 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-13 10:52:19,195 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 10:52:19,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 29 events. 6/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2022-12-13 10:52:19,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-13 10:52:19,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 10:52:19,209 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:52:19,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 10:52:19,210 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-13 10:52:19,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-13 10:52:19,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:19,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:52:19,211 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-13 10:52:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-13 10:52:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:19,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926084548] [2022-12-13 10:52:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:19,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926084548] [2022-12-13 10:52:19,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926084548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:19,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:52:19,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:52:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991318425] [2022-12-13 10:52:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:19,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:52:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:52:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:52:19,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:52:19,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) 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-13 10:52:19,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:19,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:52:19,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:19,377 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-13 10:52:19,377 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 10:52:19,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-13 10:52:19,378 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-13 10:52:19,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-13 10:52:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:52:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:52:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 10:52:19,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-13 10:52:19,380 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-13 10:52:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-13 10:52:19,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:52:19,381 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-13 10:52:19,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-13 10:52:19,381 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-13 10:52:19,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:19,382 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-13 10:52:19,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:19,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:19,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-13 10:52:19,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-13 10:52:19,385 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-13 10:52:19,386 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:52:19,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-13 10:52:19,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-13 10:52:19,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 10:52:19,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:52:19,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-13 10:52:19,643 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-13 10:52:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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-13 10:52:19,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:19,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:52:19,643 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-13 10:52:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-13 10:52:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712705208] [2022-12-13 10:52:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:19,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:19,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712705208] [2022-12-13 10:52:19,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712705208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:19,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:52:19,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:52:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080040835] [2022-12-13 10:52:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:52:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:52:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:52:19,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:52:19,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 80 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-13 10:52:19,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:19,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:52:19,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:19,864 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-13 10:52:19,864 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 10:52:19,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 381 events. 228/381 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 858. Up to 212 conditions per place. [2022-12-13 10:52:19,867 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-13 10:52:19,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-13 10:52:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:52:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:52:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 10:52:19,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-13 10:52:19,869 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-13 10:52:19,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-13 10:52:19,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 244 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 10:52:19,872 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-13 10:52:19,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=30, PETRI_TRANSITIONS=39} [2022-12-13 10:52:19,874 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-13 10:52:19,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:19,874 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-13 10:52:19,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:19,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:19,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-13 10:52:19,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-13 10:52:19,882 INFO L130 PetriNetUnfolder]: 29/80 cut-off events. [2022-12-13 10:52:19,882 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 10:52:19,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 80 events. 29/80 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 235 event pairs, 1 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 166. Up to 28 conditions per place. [2022-12-13 10:52:19,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-13 10:52:19,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 10:52:19,893 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:52:19,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 10:52:19,896 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-13 10:52:19,896 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-13 10:52:19,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:19,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:52:19,897 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-13 10:52:19,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-13 10:52:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:19,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513674334] [2022-12-13 10:52:19,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:20,020 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-13 10:52:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:20,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513674334] [2022-12-13 10:52:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513674334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:20,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:52:20,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 10:52:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905404795] [2022-12-13 10:52:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:20,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:52:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:52:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:52:20,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 10:52:20,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 10:52:20,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:20,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 10:52:20,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:20,096 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-13 10:52:20,096 INFO L131 PetriNetUnfolder]: For 454/463 co-relation queries the response was YES. [2022-12-13 10:52:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 490 events. 296/490 cut-off events. For 454/463 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1901 event pairs, 100 based on Foata normal form. 5/449 useless extension candidates. Maximal degree in co-relation 874. Up to 263 conditions per place. [2022-12-13 10:52:20,099 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-13 10:52:20,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-13 10:52:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:52:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:52:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 10:52:20,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-13 10:52:20,100 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-13 10:52:20,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-13 10:52:20,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 10:52:20,102 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-13 10:52:20,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2022-12-13 10:52:20,103 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-13 10:52:20,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:20,103 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-13 10:52:20,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:20,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:20,104 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-13 10:52:20,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-13 10:52:20,113 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-13 10:52:20,113 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 10:52:20,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 101 events. 37/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2022-12-13 10:52:20,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-13 10:52:20,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 10:52:20,122 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:52:20,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 10:52:20,122 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-13 10:52:20,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 10:52:20,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:20,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:20,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:52:20,123 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-13 10:52:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-13 10:52:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:20,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322122177] [2022-12-13 10:52:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:20,243 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-13 10:52:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:20,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322122177] [2022-12-13 10:52:20,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322122177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:52:20,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077801148] [2022-12-13 10:52:20,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:20,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:52:20,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 10:52:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:20,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 10:52:20,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:52:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:52:20,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:52:20,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077801148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:20,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:52:20,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-13 10:52:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071503504] [2022-12-13 10:52:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:52:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:52:20,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:52:20,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:52:20,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-13 10:52:20,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:20,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:52:20,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:20,515 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-13 10:52:20,515 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-13 10:52:20,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 527 events. 304/527 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2073 event pairs, 82 based on Foata normal form. 30/524 useless extension candidates. Maximal degree in co-relation 1085. Up to 374 conditions per place. [2022-12-13 10:52:20,517 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-13 10:52:20,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-13 10:52:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:52:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:52:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-13 10:52:20,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-13 10:52:20,518 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-13 10:52:20,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-13 10:52:20,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:52:20,521 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-13 10:52:20,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2022-12-13 10:52:20,522 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-13 10:52:20,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:20,522 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-13 10:52:20,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:20,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:20,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-13 10:52:20,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-13 10:52:20,531 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-13 10:52:20,531 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 10:52:20,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 114 events. 37/114 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 436 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-13 10:52:20,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-13 10:52:20,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 10:52:20,533 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:52:20,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 10:52:20,533 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-13 10:52:20,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-13 10:52:20,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:20,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:20,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 10:52:20,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:20,738 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-13 10:52:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-13 10:52:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:20,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512675145] [2022-12-13 10:52:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:52:20,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:20,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512675145] [2022-12-13 10:52:20,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512675145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:20,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:52:20,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:52:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463989116] [2022-12-13 10:52:20,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:52:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:52:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:52:20,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-13 10:52:20,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:20,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:20,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-13 10:52:20,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:20,923 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-13 10:52:20,923 INFO L131 PetriNetUnfolder]: For 796/813 co-relation queries the response was YES. [2022-12-13 10:52:20,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 631 events. 344/631 cut-off events. For 796/813 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2844 event pairs, 212 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 1467. Up to 476 conditions per place. [2022-12-13 10:52:20,926 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-13 10:52:20,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-13 10:52:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:52:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:52:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 10:52:20,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-13 10:52:20,927 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-13 10:52:20,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-13 10:52:20,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:52:20,930 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-13 10:52:20,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=42} [2022-12-13 10:52:20,931 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-13 10:52:20,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:20,931 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-13 10:52:20,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:20,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:20,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-13 10:52:20,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-13 10:52:20,940 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-13 10:52:20,940 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-13 10:52:20,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 37/115 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 436 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 293. Up to 33 conditions per place. [2022-12-13 10:52:20,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-13 10:52:20,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 10:52:21,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:52:21,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 825 [2022-12-13 10:52:21,756 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-13 10:52:21,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:21,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:21,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:21,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:52:21,757 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-13 10:52:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-13 10:52:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776773916] [2022-12-13 10:52:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:22,949 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-13 10:52:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:22,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776773916] [2022-12-13 10:52:22,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776773916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:52:22,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966347742] [2022-12-13 10:52:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:22,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:52:22,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 10:52:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:23,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 10:52:23,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:52:23,091 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 11 treesize of output 7 [2022-12-13 10:52:23,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:52:23,126 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 14 treesize of output 16 [2022-12-13 10:52:23,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:52:23,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 14 treesize of output 16 [2022-12-13 10:52:23,412 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 10:52:23,413 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 34 treesize of output 10 [2022-12-13 10:52:23,435 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-13 10:52:23,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:52:23,676 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157))) (let ((.cse4 (select .cse3 ~queue~0.base))) (or (not (= (select (select .cse3 c_~A~0.base) .cse1) (select .cse4 .cse2))) (< c_~v_old~0 (+ (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-12-13 10:52:23,790 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0) (let ((.cse2 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (< (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2) (select .cse0 .cse3))))))) (or (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157))) (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2) (select (select .cse4 ~queue~0.base) .cse3))))) (not (= (mod c_~ok~0 256) 0)))))) is different from false [2022-12-13 10:52:23,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:52:23,826 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 128 treesize of output 97 [2022-12-13 10:52:23,926 INFO L321 Elim1Store]: treesize reduction 15, result has 89.4 percent of original size [2022-12-13 10:52:23,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1382 treesize of output 1293 [2022-12-13 10:52:23,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:52:23,968 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 1166 treesize of output 1115 [2022-12-13 10:52:24,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:52:24,002 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 1074 treesize of output 931 [2022-12-13 10:52:24,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:52:24,031 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 890 treesize of output 865 [2022-12-13 10:52:24,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:52:24,057 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 850 treesize of output 785 [2022-12-13 10:52:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 10:52:27,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966347742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:52:27,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:52:27,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-13 10:52:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461548765] [2022-12-13 10:52:27,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:52:27,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 10:52:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:27,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 10:52:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=330, Unknown=2, NotChecked=78, Total=506 [2022-12-13 10:52:27,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:52:27,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 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-13 10:52:27,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:27,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:52:27,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:31,289 INFO L130 PetriNetUnfolder]: 1220/2121 cut-off events. [2022-12-13 10:52:31,289 INFO L131 PetriNetUnfolder]: For 2105/2105 co-relation queries the response was YES. [2022-12-13 10:52:31,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7197 conditions, 2121 events. 1220/2121 cut-off events. For 2105/2105 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11490 event pairs, 140 based on Foata normal form. 5/2000 useless extension candidates. Maximal degree in co-relation 7179. Up to 535 conditions per place. [2022-12-13 10:52:31,299 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 196 selfloop transitions, 111 changer transitions 50/357 dead transitions. [2022-12-13 10:52:31,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 357 transitions, 2455 flow [2022-12-13 10:52:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 10:52:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 10:52:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 274 transitions. [2022-12-13 10:52:31,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38429172510518933 [2022-12-13 10:52:31,302 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 31 states and 274 transitions. [2022-12-13 10:52:31,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 357 transitions, 2455 flow [2022-12-13 10:52:31,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 357 transitions, 2423 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 10:52:31,317 INFO L231 Difference]: Finished difference. Result has 77 places, 157 transitions, 1368 flow [2022-12-13 10:52:31,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1368, PETRI_PLACES=77, PETRI_TRANSITIONS=157} [2022-12-13 10:52:31,318 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2022-12-13 10:52:31,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:31,318 INFO L89 Accepts]: Start accepts. Operand has 77 places, 157 transitions, 1368 flow [2022-12-13 10:52:31,321 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:31,321 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:31,321 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 157 transitions, 1368 flow [2022-12-13 10:52:31,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 157 transitions, 1368 flow [2022-12-13 10:52:31,362 INFO L130 PetriNetUnfolder]: 203/535 cut-off events. [2022-12-13 10:52:31,362 INFO L131 PetriNetUnfolder]: For 1836/1855 co-relation queries the response was YES. [2022-12-13 10:52:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 535 events. 203/535 cut-off events. For 1836/1855 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3072 event pairs, 6 based on Foata normal form. 6/527 useless extension candidates. Maximal degree in co-relation 1883. Up to 168 conditions per place. [2022-12-13 10:52:31,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 157 transitions, 1368 flow [2022-12-13 10:52:31,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 10:52:38,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 10:52:38,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 10:52:38,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:38,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:38,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 10:52:38,249 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:42,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:42,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:49,379 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 10:52:49,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18061 [2022-12-13 10:52:49,379 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 150 transitions, 1422 flow [2022-12-13 10:52:49,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 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-13 10:52:49,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:49,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:49,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 10:52:49,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 10:52:49,584 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-13 10:52:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 776224458, now seen corresponding path program 1 times [2022-12-13 10:52:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:49,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456691247] [2022-12-13 10:52:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:50,133 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-13 10:52:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:50,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456691247] [2022-12-13 10:52:50,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456691247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:52:50,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786131738] [2022-12-13 10:52:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:50,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:50,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:52:50,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 10:52:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:50,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 10:52:50,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:52:50,222 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 10:52:50,228 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 202 treesize of output 198 [2022-12-13 10:52:50,239 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:52:50,239 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 10:52:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:52:50,358 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 10:52:50,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 10:52:50,364 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 27 treesize of output 15 [2022-12-13 10:52:50,506 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 19 treesize of output 7 [2022-12-13 10:52:50,520 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-13 10:52:50,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:52:50,651 WARN L837 $PredicateComparison]: unable to prove that (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_238 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) (< c_~start~0 0) (<= c_~n~0 c_~start~0)) is different from false [2022-12-13 10:52:50,773 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-13 10:52:50,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786131738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:52:50,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:52:50,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 10:52:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687574224] [2022-12-13 10:52:50,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:52:50,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 10:52:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 10:52:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=242, Unknown=1, NotChecked=34, Total=380 [2022-12-13 10:52:50,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:52:50,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 150 transitions, 1422 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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-13 10:52:50,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:50,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:52:50,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:52,682 INFO L130 PetriNetUnfolder]: 1797/3136 cut-off events. [2022-12-13 10:52:52,683 INFO L131 PetriNetUnfolder]: For 13106/13106 co-relation queries the response was YES. [2022-12-13 10:52:52,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14698 conditions, 3136 events. 1797/3136 cut-off events. For 13106/13106 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18391 event pairs, 317 based on Foata normal form. 34/3139 useless extension candidates. Maximal degree in co-relation 12406. Up to 1032 conditions per place. [2022-12-13 10:52:52,701 INFO L137 encePairwiseOnDemand]: 6/41 looper letters, 252 selfloop transitions, 168 changer transitions 35/455 dead transitions. [2022-12-13 10:52:52,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 455 transitions, 4719 flow [2022-12-13 10:52:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 10:52:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 10:52:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 239 transitions. [2022-12-13 10:52:52,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26496674057649666 [2022-12-13 10:52:52,703 INFO L175 Difference]: Start difference. First operand has 69 places, 150 transitions, 1422 flow. Second operand 22 states and 239 transitions. [2022-12-13 10:52:52,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 455 transitions, 4719 flow [2022-12-13 10:52:52,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 455 transitions, 4131 flow, removed 183 selfloop flow, removed 6 redundant places. [2022-12-13 10:52:52,761 INFO L231 Difference]: Finished difference. Result has 103 places, 272 transitions, 2918 flow [2022-12-13 10:52:52,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2918, PETRI_PLACES=103, PETRI_TRANSITIONS=272} [2022-12-13 10:52:52,762 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 78 predicate places. [2022-12-13 10:52:52,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:52,762 INFO L89 Accepts]: Start accepts. Operand has 103 places, 272 transitions, 2918 flow [2022-12-13 10:52:52,763 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:52,763 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:52,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 272 transitions, 2918 flow [2022-12-13 10:52:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 272 transitions, 2918 flow [2022-12-13 10:52:52,887 INFO L130 PetriNetUnfolder]: 702/1554 cut-off events. [2022-12-13 10:52:52,887 INFO L131 PetriNetUnfolder]: For 9825/10084 co-relation queries the response was YES. [2022-12-13 10:52:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7848 conditions, 1554 events. 702/1554 cut-off events. For 9825/10084 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10892 event pairs, 142 based on Foata normal form. 10/1432 useless extension candidates. Maximal degree in co-relation 7794. Up to 496 conditions per place. [2022-12-13 10:52:52,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 272 transitions, 2918 flow [2022-12-13 10:52:52,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-13 10:52:52,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:52,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:53,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [711] $Ultimate##0-->L79: Formula: (and (= (+ v_~start~0_167 1) v_~start~0_166) (= (ite (and (<= 0 v_~start~0_167) (< v_~start~0_167 v_~n~0_120) (< v_~start~0_167 v_~end~0_201)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= (ite (= (ite (and (<= v_~v_old~0_109 v_~new~0_74) (not (= (mod v_~ok~0_113 256) 0))) 1 0) 0) 0 1) v_~ok~0_112) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25| 0)) (= v_~new~0_74 (select (select |v_#memory_int_317| v_~queue~0.base_126) (+ (* v_~start~0_167 4) v_~queue~0.offset_126))) (= v_~new~0_74 v_~v_old~0_108) (= |v_thread2Thread1of1ForFork1_~cond~0#1_92| (ite (= 0 (ite (or (< v_~start~0_166 v_~end~0_201) (< v_~i~0_222 v_~N~0_177)) 1 0)) 0 1))) InVars {~start~0=v_~start~0_167, ~queue~0.offset=v_~queue~0.offset_126, ~ok~0=v_~ok~0_113, ~i~0=v_~i~0_222, #memory_int=|v_#memory_int_317|, ~end~0=v_~end~0_201, ~N~0=v_~N~0_177, ~v_old~0=v_~v_old~0_109, ~queue~0.base=v_~queue~0.base_126, ~n~0=v_~n~0_120} OutVars{~start~0=v_~start~0_166, ~new~0=v_~new~0_74, ~queue~0.offset=v_~queue~0.offset_126, ~ok~0=v_~ok~0_112, ~i~0=v_~i~0_222, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~N~0=v_~N~0_177, ~queue~0.base=v_~queue~0.base_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_92|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_317|, ~end~0=v_~end~0_201, ~v_old~0=v_~v_old~0_108, ~n~0=v_~n~0_120} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~v_old~0_45 v_~new~0_39)) 1 0) 0) 0 1) v_~ok~0_50)) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-13 10:52:53,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [712] $Ultimate##0-->L59: Formula: (and (= (+ v_~i~0_225 1) v_~i~0_224) (= |v_thread2Thread1of1ForFork1_~cond~0#1_96| (ite (= (ite (or (< v_~i~0_225 v_~N~0_179) (< v_~start~0_170 v_~end~0_203)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_170, ~i~0=v_~i~0_225, ~end~0=v_~end~0_203, ~N~0=v_~N~0_179} OutVars{~start~0=v_~start~0_170, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_54|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_96|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_43|, ~i~0=v_~i~0_224, ~end~0=v_~end~0_203, ~N~0=v_~N~0_179} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:53,698 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:52:53,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 937 [2022-12-13 10:52:53,699 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 269 transitions, 2965 flow [2022-12-13 10:52:53,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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-13 10:52:53,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:53,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:53,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 10:52:53,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:53,908 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-13 10:52:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash -200994706, now seen corresponding path program 1 times [2022-12-13 10:52:53,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168799786] [2022-12-13 10:52:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:54,894 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-13 10:52:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168799786] [2022-12-13 10:52:54,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168799786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:52:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151158746] [2022-12-13 10:52:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:54,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:54,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:54,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:52:54,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 10:52:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:54,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 10:52:54,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:52:55,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:52:55,086 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 10:52:55,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 10:52:55,092 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 27 treesize of output 15 [2022-12-13 10:52:55,192 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 19 treesize of output 7 [2022-12-13 10:52:55,209 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-13 10:52:55,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:52:55,418 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-13 10:52:55,418 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 74 treesize of output 73 [2022-12-13 10:52:55,432 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 33 treesize of output 27 [2022-12-13 10:52:55,480 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-13 10:52:55,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151158746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:52:55,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:52:55,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-13 10:52:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808485733] [2022-12-13 10:52:55,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:52:55,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 10:52:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 10:52:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2022-12-13 10:52:55,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:52:55,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 269 transitions, 2965 flow. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-13 10:52:55,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:55,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:52:55,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:56,804 INFO L130 PetriNetUnfolder]: 2228/3835 cut-off events. [2022-12-13 10:52:56,804 INFO L131 PetriNetUnfolder]: For 25525/25525 co-relation queries the response was YES. [2022-12-13 10:52:56,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22314 conditions, 3835 events. 2228/3835 cut-off events. For 25525/25525 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 23945 event pairs, 190 based on Foata normal form. 3/3834 useless extension candidates. Maximal degree in co-relation 22256. Up to 1302 conditions per place. [2022-12-13 10:52:56,838 INFO L137 encePairwiseOnDemand]: 19/57 looper letters, 261 selfloop transitions, 180 changer transitions 19/460 dead transitions. [2022-12-13 10:52:56,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 460 transitions, 5696 flow [2022-12-13 10:52:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:52:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:52:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 183 transitions. [2022-12-13 10:52:56,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22932330827067668 [2022-12-13 10:52:56,839 INFO L175 Difference]: Start difference. First operand has 97 places, 269 transitions, 2965 flow. Second operand 14 states and 183 transitions. [2022-12-13 10:52:56,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 460 transitions, 5696 flow [2022-12-13 10:52:56,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 460 transitions, 5311 flow, removed 185 selfloop flow, removed 7 redundant places. [2022-12-13 10:52:56,950 INFO L231 Difference]: Finished difference. Result has 112 places, 320 transitions, 3905 flow [2022-12-13 10:52:56,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2587, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3905, PETRI_PLACES=112, PETRI_TRANSITIONS=320} [2022-12-13 10:52:56,951 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 87 predicate places. [2022-12-13 10:52:56,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:56,952 INFO L89 Accepts]: Start accepts. Operand has 112 places, 320 transitions, 3905 flow [2022-12-13 10:52:56,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:56,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:56,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 320 transitions, 3905 flow [2022-12-13 10:52:56,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 320 transitions, 3905 flow [2022-12-13 10:52:57,164 INFO L130 PetriNetUnfolder]: 949/2103 cut-off events. [2022-12-13 10:52:57,164 INFO L131 PetriNetUnfolder]: For 15709/16052 co-relation queries the response was YES. [2022-12-13 10:52:57,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11351 conditions, 2103 events. 949/2103 cut-off events. For 15709/16052 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 16142 event pairs, 199 based on Foata normal form. 17/1946 useless extension candidates. Maximal degree in co-relation 11025. Up to 683 conditions per place. [2022-12-13 10:52:57,184 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 320 transitions, 3905 flow [2022-12-13 10:52:57,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-13 10:52:57,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:52:57,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:52:57,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-13 10:52:57,287 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 319 transitions, 3920 flow [2022-12-13 10:52:57,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-13 10:52:57,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:57,287 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:57,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 10:52:57,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:57,488 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-13 10:52:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1152175436, now seen corresponding path program 1 times [2022-12-13 10:52:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:57,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767546500] [2022-12-13 10:52:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:52:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:57,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767546500] [2022-12-13 10:52:57,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767546500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:52:57,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537126968] [2022-12-13 10:52:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:57,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:52:57,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:52:57,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:52:57,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 10:52:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:57,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 10:52:57,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:52:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:57,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:52:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:57,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537126968] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:52:57,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:52:57,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-13 10:52:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071154575] [2022-12-13 10:52:57,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:52:57,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:52:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:52:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:52:57,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 10:52:57,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 319 transitions, 3920 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:57,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:57,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 10:52:57,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:52:58,403 INFO L130 PetriNetUnfolder]: 2494/4269 cut-off events. [2022-12-13 10:52:58,403 INFO L131 PetriNetUnfolder]: For 35491/35491 co-relation queries the response was YES. [2022-12-13 10:52:58,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26889 conditions, 4269 events. 2494/4269 cut-off events. For 35491/35491 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26561 event pairs, 351 based on Foata normal form. 34/4292 useless extension candidates. Maximal degree in co-relation 25721. Up to 1558 conditions per place. [2022-12-13 10:52:58,432 INFO L137 encePairwiseOnDemand]: 21/59 looper letters, 259 selfloop transitions, 203 changer transitions 0/462 dead transitions. [2022-12-13 10:52:58,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 462 transitions, 6374 flow [2022-12-13 10:52:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:52:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:52:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 10:52:58,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2796610169491525 [2022-12-13 10:52:58,433 INFO L175 Difference]: Start difference. First operand has 111 places, 319 transitions, 3920 flow. Second operand 6 states and 99 transitions. [2022-12-13 10:52:58,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 462 transitions, 6374 flow [2022-12-13 10:52:58,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 462 transitions, 6270 flow, removed 49 selfloop flow, removed 2 redundant places. [2022-12-13 10:52:58,559 INFO L231 Difference]: Finished difference. Result has 118 places, 384 transitions, 5546 flow [2022-12-13 10:52:58,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=3771, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5546, PETRI_PLACES=118, PETRI_TRANSITIONS=384} [2022-12-13 10:52:58,561 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 93 predicate places. [2022-12-13 10:52:58,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:52:58,561 INFO L89 Accepts]: Start accepts. Operand has 118 places, 384 transitions, 5546 flow [2022-12-13 10:52:58,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:52:58,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:52:58,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 384 transitions, 5546 flow [2022-12-13 10:52:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 384 transitions, 5546 flow [2022-12-13 10:52:58,799 INFO L130 PetriNetUnfolder]: 1114/2429 cut-off events. [2022-12-13 10:52:58,799 INFO L131 PetriNetUnfolder]: For 23818/24257 co-relation queries the response was YES. [2022-12-13 10:52:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15195 conditions, 2429 events. 1114/2429 cut-off events. For 23818/24257 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 18645 event pairs, 228 based on Foata normal form. 38/2257 useless extension candidates. Maximal degree in co-relation 14454. Up to 849 conditions per place. [2022-12-13 10:52:58,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 384 transitions, 5546 flow [2022-12-13 10:52:58,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-13 10:52:58,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [701] L79-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= (+ v_~i~0_189 1) v_~i~0_188) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_72| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_72|, ~i~0=v_~i~0_189} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_72|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_33|, ~i~0=v_~i~0_188, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~mem1#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 10:52:58,920 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:52:58,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-13 10:52:58,920 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 384 transitions, 5550 flow [2022-12-13 10:52:58,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:58,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:52:58,921 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:52:58,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 10:52:59,121 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,SelfDestructingSolverStorable9 [2022-12-13 10:52:59,125 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-13 10:52:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:52:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash -765736587, now seen corresponding path program 1 times [2022-12-13 10:52:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:52:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566479432] [2022-12-13 10:52:59,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:52:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:52:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:52:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:52:59,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:52:59,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566479432] [2022-12-13 10:52:59,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566479432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:52:59,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:52:59,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:52:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551122348] [2022-12-13 10:52:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:52:59,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:52:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:52:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:52:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:52:59,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:52:59,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 384 transitions, 5550 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:52:59,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:52:59,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:52:59,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:00,295 INFO L130 PetriNetUnfolder]: 3764/6610 cut-off events. [2022-12-13 10:53:00,295 INFO L131 PetriNetUnfolder]: For 72333/72333 co-relation queries the response was YES. [2022-12-13 10:53:00,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46318 conditions, 6610 events. 3764/6610 cut-off events. For 72333/72333 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 43638 event pairs, 515 based on Foata normal form. 360/6952 useless extension candidates. Maximal degree in co-relation 44927. Up to 2585 conditions per place. [2022-12-13 10:53:00,340 INFO L137 encePairwiseOnDemand]: 36/56 looper letters, 381 selfloop transitions, 195 changer transitions 2/578 dead transitions. [2022-12-13 10:53:00,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 578 transitions, 9414 flow [2022-12-13 10:53:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:53:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:53:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 10:53:00,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-13 10:53:00,342 INFO L175 Difference]: Start difference. First operand has 118 places, 384 transitions, 5550 flow. Second operand 4 states and 94 transitions. [2022-12-13 10:53:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 578 transitions, 9414 flow [2022-12-13 10:53:00,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 578 transitions, 9322 flow, removed 46 selfloop flow, removed 0 redundant places. [2022-12-13 10:53:00,652 INFO L231 Difference]: Finished difference. Result has 123 places, 494 transitions, 8199 flow [2022-12-13 10:53:00,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5322, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8199, PETRI_PLACES=123, PETRI_TRANSITIONS=494} [2022-12-13 10:53:00,652 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 98 predicate places. [2022-12-13 10:53:00,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:00,652 INFO L89 Accepts]: Start accepts. Operand has 123 places, 494 transitions, 8199 flow [2022-12-13 10:53:00,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:00,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:00,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 494 transitions, 8199 flow [2022-12-13 10:53:00,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 494 transitions, 8199 flow [2022-12-13 10:53:01,140 INFO L130 PetriNetUnfolder]: 1815/4046 cut-off events. [2022-12-13 10:53:01,140 INFO L131 PetriNetUnfolder]: For 43789/44455 co-relation queries the response was YES. [2022-12-13 10:53:01,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26380 conditions, 4046 events. 1815/4046 cut-off events. For 43789/44455 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 33057 event pairs, 405 based on Foata normal form. 37/3750 useless extension candidates. Maximal degree in co-relation 25112. Up to 1563 conditions per place. [2022-12-13 10:53:01,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 494 transitions, 8199 flow [2022-12-13 10:53:01,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-13 10:53:01,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#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_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 10:53:01,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= v_~last~0_20 |v_thread1Thread1of1ForFork0_#t~mem1#1_25|)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 10:53:01,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L59-->L50: Formula: (and (<= v_~last~0_22 (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37))) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 10:53:01,364 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:53:01,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 713 [2022-12-13 10:53:01,365 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 494 transitions, 8223 flow [2022-12-13 10:53:01,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:53:01,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:01,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:01,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:53:01,366 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-13 10:53:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:01,366 INFO L85 PathProgramCache]: Analyzing trace with hash 73590568, now seen corresponding path program 1 times [2022-12-13 10:53:01,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:01,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025763914] [2022-12-13 10:53:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:01,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:01,428 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-13 10:53:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:01,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025763914] [2022-12-13 10:53:01,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025763914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:53:01,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28054685] [2022-12-13 10:53:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:53:01,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:53:01,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 10:53:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:01,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:53:01,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:53:01,553 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-13 10:53:01,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:53:01,575 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-13 10:53:01,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28054685] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:53:01,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:53:01,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 10:53:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084249830] [2022-12-13 10:53:01,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:53:01,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:53:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:01,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:53:01,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:53:01,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:53:01,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 494 transitions, 8223 flow. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-13 10:53:01,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:01,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:53:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:03,052 INFO L130 PetriNetUnfolder]: 4618/8119 cut-off events. [2022-12-13 10:53:03,053 INFO L131 PetriNetUnfolder]: For 107489/107489 co-relation queries the response was YES. [2022-12-13 10:53:03,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61533 conditions, 8119 events. 4618/8119 cut-off events. For 107489/107489 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 56614 event pairs, 1085 based on Foata normal form. 105/8198 useless extension candidates. Maximal degree in co-relation 59671. Up to 3503 conditions per place. [2022-12-13 10:53:03,113 INFO L137 encePairwiseOnDemand]: 32/57 looper letters, 602 selfloop transitions, 155 changer transitions 1/758 dead transitions. [2022-12-13 10:53:03,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 758 transitions, 14049 flow [2022-12-13 10:53:03,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:53:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:53:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-13 10:53:03,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41403508771929826 [2022-12-13 10:53:03,114 INFO L175 Difference]: Start difference. First operand has 123 places, 494 transitions, 8223 flow. Second operand 5 states and 118 transitions. [2022-12-13 10:53:03,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 758 transitions, 14049 flow [2022-12-13 10:53:03,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 758 transitions, 13977 flow, removed 36 selfloop flow, removed 0 redundant places. [2022-12-13 10:53:03,536 INFO L231 Difference]: Finished difference. Result has 129 places, 561 transitions, 9788 flow [2022-12-13 10:53:03,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=8179, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9788, PETRI_PLACES=129, PETRI_TRANSITIONS=561} [2022-12-13 10:53:03,537 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 104 predicate places. [2022-12-13 10:53:03,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:03,537 INFO L89 Accepts]: Start accepts. Operand has 129 places, 561 transitions, 9788 flow [2022-12-13 10:53:03,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:03,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:03,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 561 transitions, 9788 flow [2022-12-13 10:53:03,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 561 transitions, 9788 flow [2022-12-13 10:53:04,157 INFO L130 PetriNetUnfolder]: 2183/4862 cut-off events. [2022-12-13 10:53:04,158 INFO L131 PetriNetUnfolder]: For 65245/65998 co-relation queries the response was YES. [2022-12-13 10:53:04,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35591 conditions, 4862 events. 2183/4862 cut-off events. For 65245/65998 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41658 event pairs, 483 based on Foata normal form. 62/4527 useless extension candidates. Maximal degree in co-relation 34104. Up to 1798 conditions per place. [2022-12-13 10:53:04,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 561 transitions, 9788 flow [2022-12-13 10:53:04,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 2026 [2022-12-13 10:53:04,210 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:53:04,211 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 674 [2022-12-13 10:53:04,211 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 561 transitions, 9788 flow [2022-12-13 10:53:04,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-13 10:53:04,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:04,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:04,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 10:53:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:04,416 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-13 10:53:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1689288485, now seen corresponding path program 1 times [2022-12-13 10:53:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:04,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938819023] [2022-12-13 10:53:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:53:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:04,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938819023] [2022-12-13 10:53:04,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938819023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:53:04,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:53:04,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:53:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344209181] [2022-12-13 10:53:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:53:04,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:53:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:53:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:53:04,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:53:04,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 561 transitions, 9788 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-13 10:53:04,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:04,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:53:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:05,924 INFO L130 PetriNetUnfolder]: 4665/8250 cut-off events. [2022-12-13 10:53:05,924 INFO L131 PetriNetUnfolder]: For 118474/118474 co-relation queries the response was YES. [2022-12-13 10:53:05,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65534 conditions, 8250 events. 4665/8250 cut-off events. For 118474/118474 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 57851 event pairs, 508 based on Foata normal form. 8/8240 useless extension candidates. Maximal degree in co-relation 63533. Up to 6916 conditions per place. [2022-12-13 10:53:05,980 INFO L137 encePairwiseOnDemand]: 40/57 looper letters, 566 selfloop transitions, 41 changer transitions 10/617 dead transitions. [2022-12-13 10:53:05,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 617 transitions, 11827 flow [2022-12-13 10:53:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:53:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:53:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 10:53:05,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4093567251461988 [2022-12-13 10:53:05,981 INFO L175 Difference]: Start difference. First operand has 129 places, 561 transitions, 9788 flow. Second operand 3 states and 70 transitions. [2022-12-13 10:53:05,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 617 transitions, 11827 flow [2022-12-13 10:53:06,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 617 transitions, 11763 flow, removed 32 selfloop flow, removed 0 redundant places. [2022-12-13 10:53:06,432 INFO L231 Difference]: Finished difference. Result has 133 places, 562 transitions, 9870 flow [2022-12-13 10:53:06,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=9636, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=9870, PETRI_PLACES=133, PETRI_TRANSITIONS=562} [2022-12-13 10:53:06,432 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 108 predicate places. [2022-12-13 10:53:06,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:06,433 INFO L89 Accepts]: Start accepts. Operand has 133 places, 562 transitions, 9870 flow [2022-12-13 10:53:06,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:06,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:06,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 562 transitions, 9870 flow [2022-12-13 10:53:06,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 562 transitions, 9870 flow [2022-12-13 10:53:07,064 INFO L130 PetriNetUnfolder]: 2241/5110 cut-off events. [2022-12-13 10:53:07,065 INFO L131 PetriNetUnfolder]: For 71774/72386 co-relation queries the response was YES. [2022-12-13 10:53:07,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37629 conditions, 5110 events. 2241/5110 cut-off events. For 71774/72386 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 45018 event pairs, 476 based on Foata normal form. 58/4754 useless extension candidates. Maximal degree in co-relation 36062. Up to 1869 conditions per place. [2022-12-13 10:53:07,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 562 transitions, 9870 flow [2022-12-13 10:53:07,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 2018 [2022-12-13 10:53:07,127 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:53:07,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 694 [2022-12-13 10:53:07,127 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 562 transitions, 9870 flow [2022-12-13 10:53:07,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-13 10:53:07,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:07,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:07,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 10:53:07,128 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-13 10:53:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1799794713, now seen corresponding path program 1 times [2022-12-13 10:53:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:07,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407870753] [2022-12-13 10:53:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:07,199 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-13 10:53:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407870753] [2022-12-13 10:53:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407870753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:53:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280551217] [2022-12-13 10:53:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:07,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:07,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:53:07,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:53:07,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 10:53:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:07,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:53:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:53:07,332 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-13 10:53:07,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:53:07,354 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-13 10:53:07,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280551217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:53:07,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:53:07,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 10:53:07,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360996869] [2022-12-13 10:53:07,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:53:07,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:53:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:07,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:53:07,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:53:07,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:53:07,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 562 transitions, 9870 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 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-13 10:53:07,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:07,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:53:07,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:09,508 INFO L130 PetriNetUnfolder]: 6105/10793 cut-off events. [2022-12-13 10:53:09,508 INFO L131 PetriNetUnfolder]: For 166316/166316 co-relation queries the response was YES. [2022-12-13 10:53:09,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88126 conditions, 10793 events. 6105/10793 cut-off events. For 166316/166316 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 79886 event pairs, 1348 based on Foata normal form. 153/10920 useless extension candidates. Maximal degree in co-relation 84193. Up to 4592 conditions per place. [2022-12-13 10:53:09,613 INFO L137 encePairwiseOnDemand]: 32/55 looper letters, 810 selfloop transitions, 230 changer transitions 2/1042 dead transitions. [2022-12-13 10:53:09,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 1042 transitions, 20170 flow [2022-12-13 10:53:09,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:53:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:53:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2022-12-13 10:53:09,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42337662337662335 [2022-12-13 10:53:09,628 INFO L175 Difference]: Start difference. First operand has 133 places, 562 transitions, 9870 flow. Second operand 7 states and 163 transitions. [2022-12-13 10:53:09,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 1042 transitions, 20170 flow [2022-12-13 10:53:10,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 1042 transitions, 19990 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:53:10,423 INFO L231 Difference]: Finished difference. Result has 139 places, 654 transitions, 12211 flow [2022-12-13 10:53:10,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=9788, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12211, PETRI_PLACES=139, PETRI_TRANSITIONS=654} [2022-12-13 10:53:10,424 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 114 predicate places. [2022-12-13 10:53:10,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:10,424 INFO L89 Accepts]: Start accepts. Operand has 139 places, 654 transitions, 12211 flow [2022-12-13 10:53:10,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:10,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:10,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 654 transitions, 12211 flow [2022-12-13 10:53:10,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 654 transitions, 12211 flow [2022-12-13 10:53:11,332 INFO L130 PetriNetUnfolder]: 2929/6563 cut-off events. [2022-12-13 10:53:11,333 INFO L131 PetriNetUnfolder]: For 105934/106675 co-relation queries the response was YES. [2022-12-13 10:53:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52501 conditions, 6563 events. 2929/6563 cut-off events. For 105934/106675 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 59952 event pairs, 617 based on Foata normal form. 94/6125 useless extension candidates. Maximal degree in co-relation 49609. Up to 2365 conditions per place. [2022-12-13 10:53:11,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 654 transitions, 12211 flow [2022-12-13 10:53:11,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 2220 [2022-12-13 10:53:11,543 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:53:11,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1120 [2022-12-13 10:53:11,544 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 654 transitions, 12211 flow [2022-12-13 10:53:11,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 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-13 10:53:11,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:11,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:11,559 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-13 10:53:11,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:11,748 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-13 10:53:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1438999129, now seen corresponding path program 1 times [2022-12-13 10:53:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:11,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686018104] [2022-12-13 10:53:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:12,480 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-13 10:53:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686018104] [2022-12-13 10:53:12,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686018104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:53:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278321450] [2022-12-13 10:53:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:12,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:12,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:53:12,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:53:12,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 10:53:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:12,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:53:12,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:53:12,735 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 10:53:12,735 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 10 [2022-12-13 10:53:12,751 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-13 10:53:12,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:53:16,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:53:16,993 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 74 treesize of output 125 [2022-12-13 10:53:17,106 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-13 10:53:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278321450] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:53:17,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:53:17,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 21 [2022-12-13 10:53:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643111386] [2022-12-13 10:53:17,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:53:17,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 10:53:17,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 10:53:17,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2022-12-13 10:53:17,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:53:17,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 654 transitions, 12211 flow. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-13 10:53:17,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:17,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:53:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:24,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 10:53:26,698 INFO L130 PetriNetUnfolder]: 7123/12553 cut-off events. [2022-12-13 10:53:26,698 INFO L131 PetriNetUnfolder]: For 202445/202445 co-relation queries the response was YES. [2022-12-13 10:53:26,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106011 conditions, 12553 events. 7123/12553 cut-off events. For 202445/202445 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 94967 event pairs, 432 based on Foata normal form. 41/12556 useless extension candidates. Maximal degree in co-relation 94764. Up to 4787 conditions per place. [2022-12-13 10:53:26,796 INFO L137 encePairwiseOnDemand]: 20/55 looper letters, 666 selfloop transitions, 363 changer transitions 37/1066 dead transitions. [2022-12-13 10:53:26,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 1066 transitions, 20880 flow [2022-12-13 10:53:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 10:53:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 10:53:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 214 transitions. [2022-12-13 10:53:26,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1691699604743083 [2022-12-13 10:53:26,798 INFO L175 Difference]: Start difference. First operand has 139 places, 654 transitions, 12211 flow. Second operand 23 states and 214 transitions. [2022-12-13 10:53:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 1066 transitions, 20880 flow [2022-12-13 10:53:27,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 1066 transitions, 20440 flow, removed 169 selfloop flow, removed 4 redundant places. [2022-12-13 10:53:27,733 INFO L231 Difference]: Finished difference. Result has 170 places, 745 transitions, 14815 flow [2022-12-13 10:53:27,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=10349, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=14815, PETRI_PLACES=170, PETRI_TRANSITIONS=745} [2022-12-13 10:53:27,733 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 145 predicate places. [2022-12-13 10:53:27,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:27,734 INFO L89 Accepts]: Start accepts. Operand has 170 places, 745 transitions, 14815 flow [2022-12-13 10:53:27,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:27,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:27,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 745 transitions, 14815 flow [2022-12-13 10:53:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 745 transitions, 14815 flow [2022-12-13 10:53:28,891 INFO L130 PetriNetUnfolder]: 3485/7671 cut-off events. [2022-12-13 10:53:28,891 INFO L131 PetriNetUnfolder]: For 139009/139678 co-relation queries the response was YES. [2022-12-13 10:53:28,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64230 conditions, 7671 events. 3485/7671 cut-off events. For 139009/139678 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 71409 event pairs, 723 based on Foata normal form. 29/7064 useless extension candidates. Maximal degree in co-relation 63339. Up to 2792 conditions per place. [2022-12-13 10:53:28,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 745 transitions, 14815 flow [2022-12-13 10:53:28,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 2654 [2022-12-13 10:53:28,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 10:53:32,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] and [678] L104-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (= 0 (mod v_~ok~0_In_1 256)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~ok~0=v_~ok~0_In_1} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_Out_2|, ~ok~0=v_~ok~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 10:53:32,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [678] L104-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (= 0 (mod v_~ok~0_In_1 256)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~ok~0=v_~ok~0_In_1} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_Out_2|, ~ok~0=v_~ok~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 10:53:32,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] and [678] L104-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (= 0 (mod v_~ok~0_In_1 256)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~ok~0=v_~ok~0_In_1} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_Out_2|, ~ok~0=v_~ok~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 10:53:32,305 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:53:32,306 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4573 [2022-12-13 10:53:32,306 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 744 transitions, 14843 flow [2022-12-13 10:53:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-13 10:53:32,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:32,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:32,311 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-13 10:53:32,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 10:53:32,510 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-13 10:53:32,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1813099323, now seen corresponding path program 1 times [2022-12-13 10:53:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:32,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011868104] [2022-12-13 10:53:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:32,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:34,155 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-13 10:53:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:34,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011868104] [2022-12-13 10:53:34,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011868104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:53:34,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435555375] [2022-12-13 10:53:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:34,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:34,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:53:34,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:53:34,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 10:53:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:34,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 10:53:34,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:53:34,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:53:34,397 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 10:53:34,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 10:53:34,410 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 27 treesize of output 15 [2022-12-13 10:53:34,608 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 19 treesize of output 7 [2022-12-13 10:53:34,623 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-13 10:53:34,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:53:34,818 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-13 10:53:34,818 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 74 treesize of output 73 [2022-12-13 10:53:34,822 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 33 treesize of output 27 [2022-12-13 10:53:34,893 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-13 10:53:34,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435555375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:53:34,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:53:34,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-13 10:53:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885163786] [2022-12-13 10:53:34,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:53:34,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 10:53:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 10:53:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=417, Unknown=2, NotChecked=0, Total=552 [2022-12-13 10:53:34,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:53:34,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 744 transitions, 14843 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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-13 10:53:34,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:34,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:53:34,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:39,588 INFO L130 PetriNetUnfolder]: 9399/16411 cut-off events. [2022-12-13 10:53:39,589 INFO L131 PetriNetUnfolder]: For 330678/330678 co-relation queries the response was YES. [2022-12-13 10:53:39,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148383 conditions, 16411 events. 9399/16411 cut-off events. For 330678/330678 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 129323 event pairs, 694 based on Foata normal form. 8/16314 useless extension candidates. Maximal degree in co-relation 146109. Up to 6353 conditions per place. [2022-12-13 10:53:39,730 INFO L137 encePairwiseOnDemand]: 22/56 looper letters, 591 selfloop transitions, 630 changer transitions 20/1241 dead transitions. [2022-12-13 10:53:39,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1241 transitions, 26647 flow [2022-12-13 10:53:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:53:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:53:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 197 transitions. [2022-12-13 10:53:39,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19543650793650794 [2022-12-13 10:53:39,738 INFO L175 Difference]: Start difference. First operand has 166 places, 744 transitions, 14843 flow. Second operand 18 states and 197 transitions. [2022-12-13 10:53:39,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1241 transitions, 26647 flow [2022-12-13 10:53:41,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1241 transitions, 26229 flow, removed 180 selfloop flow, removed 4 redundant places. [2022-12-13 10:53:41,651 INFO L231 Difference]: Finished difference. Result has 190 places, 962 transitions, 21414 flow [2022-12-13 10:53:41,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=14525, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=415, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=21414, PETRI_PLACES=190, PETRI_TRANSITIONS=962} [2022-12-13 10:53:41,652 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 165 predicate places. [2022-12-13 10:53:41,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:53:41,652 INFO L89 Accepts]: Start accepts. Operand has 190 places, 962 transitions, 21414 flow [2022-12-13 10:53:41,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:53:41,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:53:41,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 962 transitions, 21414 flow [2022-12-13 10:53:41,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 962 transitions, 21414 flow [2022-12-13 10:53:43,236 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][885], [Black: 212#(<= ~end~0 ~start~0), Black: 620#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 161#L104-2true, Black: 630#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 612#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), 1425#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1087#(and (<= ~i~0 2) (<= 3 ~N~0)), Black: 628#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 622#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 591#(or (<= ~n~0 ~start~0) (< ~start~0 0) (and (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (mod ~ok~0 256) 0)))), Black: 548#(= ~ok~0 1), Black: 966#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 848#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 618#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (+ ~start~0 1) ~end~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 610#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 813#true, Black: 841#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 815#(not (<= ~N~0 ~i~0)), Black: 1039#true, Black: 642#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 636#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), 927#true, Black: 919#(<= ~end~0 (+ ~start~0 1)), Black: 918#(= ~start~0 ~end~0), Black: 789#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 681#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 791#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 795#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 692#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 926#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= ~N~0 ~i~0))), Black: 722#(= ~ok~0 1), Black: 799#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 793#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), 916#true, 1323#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 1299#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= ~end~0 1) (and (not (= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) 8)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 12))) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1297#(and (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1295#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1311#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1227#(= ~ok~0 1), Black: 1303#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1170#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1309#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1247#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1307#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (< ~i~0 ~N~0) (= ~ok~0 1)), Black: 1184#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 357#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 185#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 395#(or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 1044#true, Black: 428#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 426#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), 568#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 422#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 440#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 198#(= ~ok~0 1), Black: 420#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 444#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 413#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 183#true, Black: 1491#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1473#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1361#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1471#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (= ~last~0 ~v_old~0) (not (<= ~start~0 2))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1405#(= ~ok~0 1), Black: 1481#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1475#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1493#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1489#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1487#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1477#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1))]) [2022-12-13 10:53:43,236 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 10:53:43,236 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:53:43,237 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:53:43,237 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:53:43,267 INFO L130 PetriNetUnfolder]: 4609/10119 cut-off events. [2022-12-13 10:53:43,267 INFO L131 PetriNetUnfolder]: For 223675/224614 co-relation queries the response was YES. [2022-12-13 10:53:43,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90034 conditions, 10119 events. 4609/10119 cut-off events. For 223675/224614 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 98864 event pairs, 925 based on Foata normal form. 77/9465 useless extension candidates. Maximal degree in co-relation 88949. Up to 3511 conditions per place. [2022-12-13 10:53:43,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 962 transitions, 21414 flow [2022-12-13 10:53:43,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 3622 [2022-12-13 10:53:48,365 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:53:48,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6713 [2022-12-13 10:53:48,365 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 962 transitions, 21482 flow [2022-12-13 10:53:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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-13 10:53:48,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:53:48,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:53:48,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 10:53:48,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 10:53:48,566 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-13 10:53:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:53:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 847096038, now seen corresponding path program 1 times [2022-12-13 10:53:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:53:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223229793] [2022-12-13 10:53:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:53:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:49,526 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-13 10:53:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:53:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223229793] [2022-12-13 10:53:49,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223229793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:53:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777758689] [2022-12-13 10:53:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:53:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:53:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:53:49,527 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-13 10:53:49,531 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-13 10:53:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:53:49,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:53:49,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:53:49,759 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 10:53:49,759 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 10 [2022-12-13 10:53:49,775 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-13 10:53:49,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:53:53,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:53:53,949 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 126 [2022-12-13 10:53:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:53:54,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777758689] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:53:54,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:53:54,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-13 10:53:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673695244] [2022-12-13 10:53:54,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:53:54,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 10:53:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:53:54,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 10:53:54,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=345, Unknown=1, NotChecked=0, Total=462 [2022-12-13 10:53:54,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:53:54,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 962 transitions, 21482 flow. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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-13 10:53:54,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:53:54,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:53:54,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:53:59,804 INFO L130 PetriNetUnfolder]: 10940/19072 cut-off events. [2022-12-13 10:53:59,804 INFO L131 PetriNetUnfolder]: For 448077/448077 co-relation queries the response was YES. [2022-12-13 10:53:59,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181908 conditions, 19072 events. 10940/19072 cut-off events. For 448077/448077 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 152998 event pairs, 796 based on Foata normal form. 8/18971 useless extension candidates. Maximal degree in co-relation 179655. Up to 7148 conditions per place. [2022-12-13 10:53:59,989 INFO L137 encePairwiseOnDemand]: 19/56 looper letters, 821 selfloop transitions, 663 changer transitions 24/1508 dead transitions. [2022-12-13 10:53:59,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1508 transitions, 34915 flow [2022-12-13 10:53:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:53:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:53:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 209 transitions. [2022-12-13 10:53:59,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23325892857142858 [2022-12-13 10:53:59,991 INFO L175 Difference]: Start difference. First operand has 189 places, 962 transitions, 21482 flow. Second operand 16 states and 209 transitions. [2022-12-13 10:53:59,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 1508 transitions, 34915 flow [2022-12-13 10:54:02,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 1508 transitions, 34113 flow, removed 201 selfloop flow, removed 4 redundant places. [2022-12-13 10:54:02,921 INFO L231 Difference]: Finished difference. Result has 208 places, 1139 transitions, 27098 flow [2022-12-13 10:54:02,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=20897, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=491, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=27098, PETRI_PLACES=208, PETRI_TRANSITIONS=1139} [2022-12-13 10:54:02,922 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 183 predicate places. [2022-12-13 10:54:02,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:54:02,922 INFO L89 Accepts]: Start accepts. Operand has 208 places, 1139 transitions, 27098 flow [2022-12-13 10:54:02,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:54:02,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:54:02,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 1139 transitions, 27098 flow [2022-12-13 10:54:02,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 1139 transitions, 27098 flow [2022-12-13 10:54:05,075 INFO L130 PetriNetUnfolder]: 5112/11372 cut-off events. [2022-12-13 10:54:05,076 INFO L131 PetriNetUnfolder]: For 277057/278111 co-relation queries the response was YES. [2022-12-13 10:54:05,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103293 conditions, 11372 events. 5112/11372 cut-off events. For 277057/278111 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 114929 event pairs, 1094 based on Foata normal form. 99/10581 useless extension candidates. Maximal degree in co-relation 103180. Up to 4018 conditions per place. [2022-12-13 10:54:05,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 1139 transitions, 27098 flow [2022-12-13 10:54:05,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 4464 [2022-12-13 10:54:10,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:54:10,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7924 [2022-12-13 10:54:10,846 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 1139 transitions, 27132 flow [2022-12-13 10:54:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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-13 10:54:10,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:54:10,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:54:10,852 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-13 10:54:11,047 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,SelfDestructingSolverStorable16 [2022-12-13 10:54:11,048 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-13 10:54:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:54:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 277046232, now seen corresponding path program 2 times [2022-12-13 10:54:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:54:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689022676] [2022-12-13 10:54:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:54:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:54:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:54:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:54:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:54:12,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689022676] [2022-12-13 10:54:12,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689022676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:54:12,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004475867] [2022-12-13 10:54:12,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:54:12,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:54:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:54:12,071 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-13 10:54:12,072 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-13 10:54:12,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:54:12,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:54:12,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 10:54:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:54:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:54:12,317 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 10:54:12,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-13 10:54:12,323 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 27 treesize of output 15 [2022-12-13 10:54:12,434 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-13 10:54:12,451 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-13 10:54:12,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:54:12,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:54:12,736 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 95 treesize of output 140 [2022-12-13 10:54:12,741 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 42 treesize of output 36 [2022-12-13 10:54:13,021 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-13 10:54:13,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004475867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:54:13,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:54:13,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-13 10:54:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708689017] [2022-12-13 10:54:13,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:54:13,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 10:54:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:54:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 10:54:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-12-13 10:54:13,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:54:13,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1139 transitions, 27132 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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-13 10:54:13,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:54:13,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:54:13,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:54:20,486 INFO L130 PetriNetUnfolder]: 12486/21746 cut-off events. [2022-12-13 10:54:20,487 INFO L131 PetriNetUnfolder]: For 588271/588271 co-relation queries the response was YES. [2022-12-13 10:54:20,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214756 conditions, 21746 events. 12486/21746 cut-off events. For 588271/588271 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 177798 event pairs, 979 based on Foata normal form. 8/21645 useless extension candidates. Maximal degree in co-relation 214633. Up to 7944 conditions per place. [2022-12-13 10:54:20,723 INFO L137 encePairwiseOnDemand]: 18/56 looper letters, 721 selfloop transitions, 845 changer transitions 33/1599 dead transitions. [2022-12-13 10:54:20,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1599 transitions, 39168 flow [2022-12-13 10:54:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 10:54:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 10:54:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 247 transitions. [2022-12-13 10:54:20,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18377976190476192 [2022-12-13 10:54:20,726 INFO L175 Difference]: Start difference. First operand has 205 places, 1139 transitions, 27132 flow. Second operand 24 states and 247 transitions. [2022-12-13 10:54:20,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1599 transitions, 39168 flow [2022-12-13 10:54:24,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1599 transitions, 38944 flow, removed 112 selfloop flow, removed 2 redundant places. [2022-12-13 10:54:24,852 INFO L231 Difference]: Finished difference. Result has 236 places, 1262 transitions, 32733 flow [2022-12-13 10:54:24,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=26966, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=738, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=32733, PETRI_PLACES=236, PETRI_TRANSITIONS=1262} [2022-12-13 10:54:24,853 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 211 predicate places. [2022-12-13 10:54:24,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:54:24,853 INFO L89 Accepts]: Start accepts. Operand has 236 places, 1262 transitions, 32733 flow [2022-12-13 10:54:24,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:54:24,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:54:24,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1262 transitions, 32733 flow [2022-12-13 10:54:24,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 1262 transitions, 32733 flow [2022-12-13 10:54:27,428 INFO L130 PetriNetUnfolder]: 5862/13064 cut-off events. [2022-12-13 10:54:27,428 INFO L131 PetriNetUnfolder]: For 364440/365756 co-relation queries the response was YES. [2022-12-13 10:54:27,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124523 conditions, 13064 events. 5862/13064 cut-off events. For 364440/365756 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 134789 event pairs, 1298 based on Foata normal form. 142/12212 useless extension candidates. Maximal degree in co-relation 124395. Up to 4616 conditions per place. [2022-12-13 10:54:27,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 1262 transitions, 32733 flow [2022-12-13 10:54:27,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 5118 [2022-12-13 10:54:34,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:54:34,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9454 [2022-12-13 10:54:34,307 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 1262 transitions, 32783 flow [2022-12-13 10:54:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 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-13 10:54:34,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:54:34,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:54:34,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 10:54:34,519 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,SelfDestructingSolverStorable17 [2022-12-13 10:54:34,520 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-13 10:54:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:54:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1051039084, now seen corresponding path program 1 times [2022-12-13 10:54:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:54:34,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803874787] [2022-12-13 10:54:34,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:54:34,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:54:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:54:35,501 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-13 10:54:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:54:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803874787] [2022-12-13 10:54:35,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803874787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:54:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132298498] [2022-12-13 10:54:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:54:35,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:54:35,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:54:35,502 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-13 10:54:35,503 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-13 10:54:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:54:35,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 10:54:35,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:54:35,633 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 10:54:35,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:54:35,636 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 14 treesize of output 16 [2022-12-13 10:54:35,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:54:35,681 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 14 treesize of output 16 [2022-12-13 10:54:35,815 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 10:54:35,815 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 34 treesize of output 10 [2022-12-13 10:54:35,833 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-13 10:54:35,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:54:40,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:54:40,414 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 128 treesize of output 97 [2022-12-13 10:54:40,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:54:40,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1759 treesize of output 1663 [2022-12-13 10:54:40,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:54:40,523 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 1510 treesize of output 1417 [2022-12-13 10:54:40,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:54:40,565 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 1338 treesize of output 1195 [2022-12-13 10:54:40,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:54:40,594 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 1154 treesize of output 1009 [2022-12-13 10:55:36,126 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-13 10:55:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132298498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:55:36,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:55:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-13 10:55:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034947756] [2022-12-13 10:55:36,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:55:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 10:55:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:55:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 10:55:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=346, Unknown=3, NotChecked=0, Total=462 [2022-12-13 10:55:36,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 10:55:36,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 1262 transitions, 32783 flow. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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-13 10:55:36,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:55:36,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 10:55:36,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:55:45,904 INFO L130 PetriNetUnfolder]: 15136/26288 cut-off events. [2022-12-13 10:55:45,904 INFO L131 PetriNetUnfolder]: For 815779/815779 co-relation queries the response was YES. [2022-12-13 10:55:46,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274600 conditions, 26288 events. 15136/26288 cut-off events. For 815779/815779 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 219836 event pairs, 1066 based on Foata normal form. 8/26178 useless extension candidates. Maximal degree in co-relation 274462. Up to 10452 conditions per place. [2022-12-13 10:55:46,257 INFO L137 encePairwiseOnDemand]: 17/58 looper letters, 881 selfloop transitions, 900 changer transitions 17/1798 dead transitions. [2022-12-13 10:55:46,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1798 transitions, 48122 flow [2022-12-13 10:55:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:55:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:55:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 223 transitions. [2022-12-13 10:55:46,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24030172413793102 [2022-12-13 10:55:46,259 INFO L175 Difference]: Start difference. First operand has 234 places, 1262 transitions, 32783 flow. Second operand 16 states and 223 transitions. [2022-12-13 10:55:46,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 1798 transitions, 48122 flow [2022-12-13 10:55:52,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1798 transitions, 47326 flow, removed 123 selfloop flow, removed 4 redundant places. [2022-12-13 10:55:52,294 INFO L231 Difference]: Finished difference. Result has 255 places, 1532 transitions, 42749 flow [2022-12-13 10:55:52,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=32169, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=642, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=42749, PETRI_PLACES=255, PETRI_TRANSITIONS=1532} [2022-12-13 10:55:52,295 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 230 predicate places. [2022-12-13 10:55:52,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:55:52,295 INFO L89 Accepts]: Start accepts. Operand has 255 places, 1532 transitions, 42749 flow [2022-12-13 10:55:52,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:55:52,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:55:52,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 1532 transitions, 42749 flow [2022-12-13 10:55:52,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 1532 transitions, 42749 flow [2022-12-13 10:55:56,139 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1432], [Black: 212#(<= ~end~0 ~start~0), Black: 620#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 161#L104-2true, Black: 630#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 612#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 1087#(and (<= ~i~0 2) (<= 3 ~N~0)), Black: 628#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 622#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 591#(or (<= ~n~0 ~start~0) (< ~start~0 0) (and (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (mod ~ok~0 256) 0)))), Black: 966#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 548#(= ~ok~0 1), 1587#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 848#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 618#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (+ ~start~0 1) ~end~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 813#true, Black: 841#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 815#(not (<= ~N~0 ~i~0)), Black: 1039#true, Black: 642#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 636#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), 927#true, Black: 919#(<= ~end~0 (+ ~start~0 1)), Black: 918#(= ~start~0 ~end~0), Black: 1810#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_774 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_774) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1808#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1722#(= ~ok~0 1), Black: 1689#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1814#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1678#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= 1 ~N~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 681#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 791#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1816#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 795#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1800#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1798#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 1 ~N~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (and (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 3)) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1)), Black: 692#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 1912#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), 926#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= ~N~0 ~i~0))), Black: 722#(= ~ok~0 1), Black: 799#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 916#true, Black: 793#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), 1323#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1297#(and (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1295#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1311#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1227#(= ~ok~0 1), Black: 1303#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1170#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1309#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1969#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1247#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1863#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1307#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (< ~i~0 ~N~0) (= ~ok~0 1)), Black: 1834#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (and (or (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 5) (<= ~end~0 3)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1963#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1184#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1892#(= ~ok~0 1), Black: 1845#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 1965#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), 357#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1885#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1971#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1967#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 185#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 395#(or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 1044#true, Black: 428#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 426#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 422#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 440#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 198#(= ~ok~0 1), Black: 420#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 444#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 413#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 183#true, Black: 1491#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1473#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1361#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1471#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (= ~last~0 ~v_old~0) (not (<= ~start~0 2))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1405#(= ~ok~0 1), Black: 1481#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1493#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 1742#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1489#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1487#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1477#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1567#(= ~ok~0 1), Black: 1638#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1)), Black: 1636#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1642#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1544#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1644#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1632#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1))]) [2022-12-13 10:55:56,139 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 10:55:56,139 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:55:56,139 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:55:56,139 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:55:56,194 INFO L130 PetriNetUnfolder]: 7103/15833 cut-off events. [2022-12-13 10:55:56,194 INFO L131 PetriNetUnfolder]: For 495257/496944 co-relation queries the response was YES. [2022-12-13 10:55:56,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156707 conditions, 15833 events. 7103/15833 cut-off events. For 495257/496944 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 167897 event pairs, 1560 based on Foata normal form. 154/14801 useless extension candidates. Maximal degree in co-relation 155809. Up to 5608 conditions per place. [2022-12-13 10:55:56,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 1532 transitions, 42749 flow [2022-12-13 10:55:56,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 6418 [2022-12-13 10:56:05,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:56:05,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12906 [2022-12-13 10:56:05,201 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 1532 transitions, 42779 flow [2022-12-13 10:56:05,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 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-13 10:56:05,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:56:05,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:56:05,207 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-13 10:56:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:56:05,402 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-13 10:56:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:56:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1761211222, now seen corresponding path program 1 times [2022-12-13 10:56:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:56:05,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930494601] [2022-12-13 10:56:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:56:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:56:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:56:05,446 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-13 10:56:05,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:56:05,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930494601] [2022-12-13 10:56:05,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930494601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:56:05,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866470695] [2022-12-13 10:56:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:56:05,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:56:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:56:05,456 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-13 10:56:05,458 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-13 10:56:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:56:05,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:56:05,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:56:05,594 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-13 10:56:05,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:56:05,608 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-13 10:56:05,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866470695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:56:05,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:56:05,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-13 10:56:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78287846] [2022-12-13 10:56:05,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:56:05,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:56:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:56:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:56:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:56:05,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 10:56:05,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1532 transitions, 42779 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:56:05,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:56:05,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 10:56:05,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:56:16,705 INFO L130 PetriNetUnfolder]: 15999/27755 cut-off events. [2022-12-13 10:56:16,705 INFO L131 PetriNetUnfolder]: For 1020841/1020841 co-relation queries the response was YES. [2022-12-13 10:56:17,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301949 conditions, 27755 events. 15999/27755 cut-off events. For 1020841/1020841 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 235303 event pairs, 3065 based on Foata normal form. 86/27724 useless extension candidates. Maximal degree in co-relation 300503. Up to 12568 conditions per place. [2022-12-13 10:56:17,157 INFO L137 encePairwiseOnDemand]: 32/59 looper letters, 1752 selfloop transitions, 283 changer transitions 1/2036 dead transitions. [2022-12-13 10:56:17,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 2036 transitions, 60785 flow [2022-12-13 10:56:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:56:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:56:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-13 10:56:17,159 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3898305084745763 [2022-12-13 10:56:17,159 INFO L175 Difference]: Start difference. First operand has 254 places, 1532 transitions, 42779 flow. Second operand 5 states and 115 transitions. [2022-12-13 10:56:17,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 2036 transitions, 60785 flow [2022-12-13 10:56:25,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 2036 transitions, 60344 flow, removed 213 selfloop flow, removed 2 redundant places. [2022-12-13 10:56:25,356 INFO L231 Difference]: Finished difference. Result has 258 places, 1556 transitions, 43921 flow [2022-12-13 10:56:25,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=42421, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=43921, PETRI_PLACES=258, PETRI_TRANSITIONS=1556} [2022-12-13 10:56:25,358 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 233 predicate places. [2022-12-13 10:56:25,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:56:25,358 INFO L89 Accepts]: Start accepts. Operand has 258 places, 1556 transitions, 43921 flow [2022-12-13 10:56:25,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:56:25,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:56:25,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 1556 transitions, 43921 flow [2022-12-13 10:56:25,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 1556 transitions, 43921 flow [2022-12-13 10:56:29,069 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1488], [Black: 212#(<= ~end~0 ~start~0), Black: 620#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 161#L104-2true, Black: 630#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 612#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 628#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1087#(and (<= ~i~0 2) (<= 3 ~N~0)), Black: 622#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 591#(or (<= ~n~0 ~start~0) (< ~start~0 0) (and (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (mod ~ok~0 256) 0)))), Black: 548#(= ~ok~0 1), Black: 966#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 848#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), 1587#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 618#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (+ ~start~0 1) ~end~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 813#true, Black: 841#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 1039#true, Black: 815#(not (<= ~N~0 ~i~0)), Black: 642#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 636#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), 927#true, Black: 919#(<= ~end~0 (+ ~start~0 1)), Black: 918#(= ~start~0 ~end~0), Black: 1810#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_774 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_774) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1808#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1722#(= ~ok~0 1), Black: 1689#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1814#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1678#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= 1 ~N~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 681#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 791#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1816#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 795#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1800#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1798#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= 1 ~N~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (and (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= (+ ~queue~0.offset (* ~end~0 4)) 3)) (= ~last~0 ~v_old~0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1)), Black: 692#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 926#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= ~N~0 ~i~0))), Black: 722#(= ~ok~0 1), Black: 799#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 916#true, Black: 793#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), 1323#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2018#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1297#(and (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1295#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1311#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1227#(= ~ok~0 1), Black: 1303#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1170#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1309#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1969#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1247#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1863#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1307#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (< ~i~0 ~N~0) (= ~ok~0 1)), Black: 1834#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (and (or (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 5) (<= ~end~0 3)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1963#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1892#(= ~ok~0 1), Black: 1184#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1845#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 1965#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1885#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), 357#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1971#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1967#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 185#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 395#(or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 1044#true, Black: 428#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 426#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 422#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 440#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 198#(= ~ok~0 1), Black: 420#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 444#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 413#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 1983#true, 183#true, Black: 1491#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1473#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1361#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1471#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (= ~last~0 ~v_old~0) (not (<= ~start~0 2))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1405#(= ~ok~0 1), Black: 1481#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1493#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 1742#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1489#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1487#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1477#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1567#(= ~ok~0 1), Black: 1638#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1)), Black: 1636#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1642#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1544#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1644#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1632#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1))]) [2022-12-13 10:56:29,069 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 10:56:29,069 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:56:29,070 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:56:29,070 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:56:29,116 INFO L130 PetriNetUnfolder]: 7459/16692 cut-off events. [2022-12-13 10:56:29,117 INFO L131 PetriNetUnfolder]: For 570436/572225 co-relation queries the response was YES. [2022-12-13 10:56:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175127 conditions, 16692 events. 7459/16692 cut-off events. For 570436/572225 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 180113 event pairs, 1637 based on Foata normal form. 181/15592 useless extension candidates. Maximal degree in co-relation 174113. Up to 5864 conditions per place. [2022-12-13 10:56:29,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 1556 transitions, 43921 flow [2022-12-13 10:56:29,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 6494 [2022-12-13 10:56:29,526 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:56:29,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4169 [2022-12-13 10:56:29,527 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 1556 transitions, 43921 flow [2022-12-13 10:56:29,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:56:29,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:56:29,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:56:29,532 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-13 10:56:29,728 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,SelfDestructingSolverStorable19 [2022-12-13 10:56:29,728 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-13 10:56:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:56:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1824669574, now seen corresponding path program 1 times [2022-12-13 10:56:29,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:56:29,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046280322] [2022-12-13 10:56:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:56:29,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:56:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:56:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:56:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:56:29,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046280322] [2022-12-13 10:56:29,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046280322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:56:29,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050014672] [2022-12-13 10:56:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:56:29,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:56:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:56:29,811 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-13 10:56:29,814 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-13 10:56:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:56:29,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:56:29,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:56:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:56:29,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:56:29,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050014672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:56:29,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:56:29,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:56:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769458355] [2022-12-13 10:56:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:56:29,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:56:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:56:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:56:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:56:29,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 10:56:29,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1556 transitions, 43921 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-13 10:56:29,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:56:29,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 10:56:29,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:56:39,422 INFO L130 PetriNetUnfolder]: 13206/23441 cut-off events. [2022-12-13 10:56:39,422 INFO L131 PetriNetUnfolder]: For 884567/884567 co-relation queries the response was YES. [2022-12-13 10:56:39,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259395 conditions, 23441 events. 13206/23441 cut-off events. For 884567/884567 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 197568 event pairs, 4710 based on Foata normal form. 447/23772 useless extension candidates. Maximal degree in co-relation 257860. Up to 21514 conditions per place. [2022-12-13 10:56:39,698 INFO L137 encePairwiseOnDemand]: 43/59 looper letters, 1165 selfloop transitions, 0 changer transitions 243/1408 dead transitions. [2022-12-13 10:56:39,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1408 transitions, 41689 flow [2022-12-13 10:56:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:56:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:56:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 10:56:39,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3898305084745763 [2022-12-13 10:56:39,699 INFO L175 Difference]: Start difference. First operand has 258 places, 1556 transitions, 43921 flow. Second operand 4 states and 92 transitions. [2022-12-13 10:56:39,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1408 transitions, 41689 flow [2022-12-13 10:56:45,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1408 transitions, 41300 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 10:56:45,322 INFO L231 Difference]: Finished difference. Result has 261 places, 1165 transitions, 31535 flow [2022-12-13 10:56:45,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=36780, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=31535, PETRI_PLACES=261, PETRI_TRANSITIONS=1165} [2022-12-13 10:56:45,324 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 236 predicate places. [2022-12-13 10:56:45,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:56:45,324 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1165 transitions, 31535 flow [2022-12-13 10:56:45,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:56:45,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:56:45,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1165 transitions, 31535 flow [2022-12-13 10:56:45,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 1165 transitions, 31535 flow [2022-12-13 10:56:48,316 INFO L130 PetriNetUnfolder]: 5963/13227 cut-off events. [2022-12-13 10:56:48,316 INFO L131 PetriNetUnfolder]: For 434622/436041 co-relation queries the response was YES. [2022-12-13 10:56:48,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135988 conditions, 13227 events. 5963/13227 cut-off events. For 434622/436041 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 135980 event pairs, 1328 based on Foata normal form. 178/12480 useless extension candidates. Maximal degree in co-relation 135007. Up to 4618 conditions per place. [2022-12-13 10:56:48,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 1165 transitions, 31535 flow [2022-12-13 10:56:48,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 4682 [2022-12-13 10:56:48,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:56:48,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:56:48,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-13 10:56:48,846 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:56:48,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3523 [2022-12-13 10:56:48,847 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1162 transitions, 31577 flow [2022-12-13 10:56:48,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-13 10:56:48,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:56:48,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:56:48,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 10:56:49,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:56:49,051 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-13 10:56:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:56:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2117299588, now seen corresponding path program 1 times [2022-12-13 10:56:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:56:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435366158] [2022-12-13 10:56:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:56:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:56:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:56:49,995 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-13 10:56:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:56:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435366158] [2022-12-13 10:56:49,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435366158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:56:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331109496] [2022-12-13 10:56:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:56:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:56:49,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:56:49,997 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-13 10:56:49,998 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-13 10:56:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:56:50,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 10:56:50,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:56:50,111 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 34 treesize of output 32 [2022-12-13 10:56:50,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-13 10:56:50,376 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 0 case distinctions, treesize of input 38 treesize of output 10 [2022-12-13 10:56:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:56:50,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:56:50,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:56:50,609 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 259 treesize of output 229 [2022-12-13 10:56:50,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:56:50,628 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 174 treesize of output 189 [2022-12-13 10:56:50,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:56:50,637 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 144 treesize of output 137 [2022-12-13 10:56:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:56:51,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331109496] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:56:51,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:56:51,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2022-12-13 10:56:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210386720] [2022-12-13 10:56:51,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:56:51,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 10:56:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:56:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 10:56:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=349, Unknown=3, NotChecked=0, Total=462 [2022-12-13 10:56:51,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:56:51,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1162 transitions, 31577 flow. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 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-13 10:56:51,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:56:51,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:56:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:01,554 INFO L130 PetriNetUnfolder]: 15977/27643 cut-off events. [2022-12-13 10:57:01,555 INFO L131 PetriNetUnfolder]: For 1028271/1028271 co-relation queries the response was YES. [2022-12-13 10:57:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306236 conditions, 27643 events. 15977/27643 cut-off events. For 1028271/1028271 co-relation queries the response was YES. Maximal size of possible extension queue 1609. Compared 233470 event pairs, 1178 based on Foata normal form. 8/27513 useless extension candidates. Maximal degree in co-relation 303751. Up to 10739 conditions per place. [2022-12-13 10:57:01,904 INFO L137 encePairwiseOnDemand]: 17/57 looper letters, 920 selfloop transitions, 911 changer transitions 19/1850 dead transitions. [2022-12-13 10:57:01,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1850 transitions, 51457 flow [2022-12-13 10:57:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:57:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:57:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 205 transitions. [2022-12-13 10:57:01,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19980506822612085 [2022-12-13 10:57:01,905 INFO L175 Difference]: Start difference. First operand has 245 places, 1162 transitions, 31577 flow. Second operand 18 states and 205 transitions. [2022-12-13 10:57:01,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1850 transitions, 51457 flow [2022-12-13 10:57:10,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1850 transitions, 50758 flow, removed 283 selfloop flow, removed 16 redundant places. [2022-12-13 10:57:10,058 INFO L231 Difference]: Finished difference. Result has 257 places, 1461 transitions, 43199 flow [2022-12-13 10:57:10,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=31217, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=626, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=43199, PETRI_PLACES=257, PETRI_TRANSITIONS=1461} [2022-12-13 10:57:10,059 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 232 predicate places. [2022-12-13 10:57:10,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:57:10,059 INFO L89 Accepts]: Start accepts. Operand has 257 places, 1461 transitions, 43199 flow [2022-12-13 10:57:10,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:57:10,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:57:10,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 1461 transitions, 43199 flow [2022-12-13 10:57:10,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 1461 transitions, 43199 flow [2022-12-13 10:57:13,677 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1407], [Black: 212#(<= ~end~0 ~start~0), Black: 620#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 161#L104-2true, Black: 630#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 612#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 1087#(and (<= ~i~0 2) (<= 3 ~N~0)), Black: 628#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 622#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 548#(= ~ok~0 1), 1587#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 618#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (+ ~start~0 1) ~end~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 848#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 813#true, Black: 2312#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 841#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 2318#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 815#(not (<= ~N~0 ~i~0)), Black: 1039#true, Black: 2300#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 642#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 2314#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (<= ~queue~0.offset (+ (* ~i~0 4) ~A~0.offset)) (= ~queue~0.offset 0) (< (+ (* ~i~0 4) ~A~0.offset) (+ ~queue~0.offset 1)) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= (* ~i~0 4) 0) (= ~ok~0 1)), Black: 636#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2220#(= ~ok~0 1), Black: 2316#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2197#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2298#(and (not (= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) 4)) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (or (not (<= ~start~0 3)) (and (<= (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) ~queue~0.offset) (<= ~queue~0.offset (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 4) (<= ~start~0 3)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2320#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~queue~0.offset (+ (* ~i~0 4) ~A~0.offset)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (< (+ (* ~i~0 4) ~A~0.offset) (+ ~queue~0.offset 1)) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= (* ~i~0 4) 0) (= ~ok~0 1)), Black: 919#(<= ~end~0 (+ ~start~0 1)), Black: 2308#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 918#(= ~start~0 ~end~0), Black: 2213#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1810#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_774 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_774) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1722#(= ~ok~0 1), Black: 1689#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 681#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1816#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 791#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1800#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), 926#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= ~N~0 ~i~0))), Black: 692#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 722#(= ~ok~0 1), Black: 799#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 916#true, Black: 793#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), 1323#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2018#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1297#(and (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1295#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1311#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1227#(= ~ok~0 1), Black: 1303#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1170#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1309#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1247#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1863#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1307#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (< ~i~0 ~N~0) (= ~ok~0 1)), Black: 1834#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (and (or (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 5) (<= ~end~0 3)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1963#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1892#(= ~ok~0 1), Black: 1184#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 1845#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 1965#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), 357#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1885#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1971#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1967#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 185#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 395#(or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), 1044#true, Black: 428#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 426#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 422#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 440#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 198#(= ~ok~0 1), Black: 420#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 444#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 413#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 1983#true, 183#true, Black: 1473#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1361#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1471#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (= ~last~0 ~v_old~0) (not (<= ~start~0 2))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1405#(= ~ok~0 1), Black: 1481#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1493#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1489#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), 1742#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), 2252#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1477#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1567#(= ~ok~0 1), Black: 1636#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1642#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1544#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1632#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1))]) [2022-12-13 10:57:13,678 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 10:57:13,678 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:57:13,678 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:57:13,678 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:57:13,757 INFO L130 PetriNetUnfolder]: 7533/16660 cut-off events. [2022-12-13 10:57:13,757 INFO L131 PetriNetUnfolder]: For 598552/600074 co-relation queries the response was YES. [2022-12-13 10:57:13,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174405 conditions, 16660 events. 7533/16660 cut-off events. For 598552/600074 co-relation queries the response was YES. Maximal size of possible extension queue 1495. Compared 177131 event pairs, 1638 based on Foata normal form. 252/15837 useless extension candidates. Maximal degree in co-relation 173511. Up to 5612 conditions per place. [2022-12-13 10:57:14,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 1461 transitions, 43199 flow [2022-12-13 10:57:14,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 6110 [2022-12-13 10:57:14,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:57:14,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4014 [2022-12-13 10:57:14,073 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 1461 transitions, 43199 flow [2022-12-13 10:57:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 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-13 10:57:14,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:14,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:14,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 10:57:14,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:57:14,274 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-13 10:57:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 155482188, now seen corresponding path program 1 times [2022-12-13 10:57:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509861621] [2022-12-13 10:57:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:57:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:14,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509861621] [2022-12-13 10:57:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509861621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:57:14,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919472419] [2022-12-13 10:57:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:14,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:57:14,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:57:14,347 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-13 10:57:14,349 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-13 10:57:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:14,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:57:14,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:57:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:57:14,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:57:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:57:14,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919472419] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:57:14,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:57:14,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 10:57:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123564683] [2022-12-13 10:57:14,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:57:14,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:57:14,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:57:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:57:14,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:57:14,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 1461 transitions, 43199 flow. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 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-13 10:57:14,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:14,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:57:14,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:25,934 INFO L130 PetriNetUnfolder]: 16606/28736 cut-off events. [2022-12-13 10:57:25,934 INFO L131 PetriNetUnfolder]: For 1182859/1182859 co-relation queries the response was YES. [2022-12-13 10:57:26,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327906 conditions, 28736 events. 16606/28736 cut-off events. For 1182859/1182859 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 243703 event pairs, 1269 based on Foata normal form. 46/28644 useless extension candidates. Maximal degree in co-relation 326455. Up to 11247 conditions per place. [2022-12-13 10:57:26,313 INFO L137 encePairwiseOnDemand]: 29/57 looper letters, 1894 selfloop transitions, 275 changer transitions 1/2170 dead transitions. [2022-12-13 10:57:26,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 2170 transitions, 68956 flow [2022-12-13 10:57:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:57:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:57:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-12-13 10:57:26,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29605263157894735 [2022-12-13 10:57:26,314 INFO L175 Difference]: Start difference. First operand has 257 places, 1461 transitions, 43199 flow. Second operand 8 states and 135 transitions. [2022-12-13 10:57:26,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 2170 transitions, 68956 flow [2022-12-13 10:57:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 2170 transitions, 68473 flow, removed 234 selfloop flow, removed 2 redundant places. [2022-12-13 10:57:35,146 INFO L231 Difference]: Finished difference. Result has 265 places, 1495 transitions, 44686 flow [2022-12-13 10:57:35,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=42895, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=44686, PETRI_PLACES=265, PETRI_TRANSITIONS=1495} [2022-12-13 10:57:35,147 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 240 predicate places. [2022-12-13 10:57:35,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:57:35,147 INFO L89 Accepts]: Start accepts. Operand has 265 places, 1495 transitions, 44686 flow [2022-12-13 10:57:35,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:57:35,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:57:35,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 1495 transitions, 44686 flow [2022-12-13 10:57:35,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 1495 transitions, 44686 flow [2022-12-13 10:57:39,233 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1466], [Black: 212#(<= ~end~0 ~start~0), 1587#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2312#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2318#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1039#true, Black: 2300#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2314#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (<= ~queue~0.offset (+ (* ~i~0 4) ~A~0.offset)) (= ~queue~0.offset 0) (< (+ (* ~i~0 4) ~A~0.offset) (+ ~queue~0.offset 1)) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= (* ~i~0 4) 0) (= ~ok~0 1)), Black: 2220#(= ~ok~0 1), Black: 2316#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2197#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2298#(and (not (= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) 4)) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (or (not (<= ~start~0 3)) (and (<= (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) ~queue~0.offset) (<= ~queue~0.offset (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 4) (<= ~start~0 3)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2320#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~queue~0.offset (+ (* ~i~0 4) ~A~0.offset)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (< (+ (* ~i~0 4) ~A~0.offset) (+ ~queue~0.offset 1)) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= (* ~i~0 4) 0) (= ~ok~0 1)), Black: 2308#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 2213#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1810#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_774 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_774) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1722#(= ~ok~0 1), Black: 1689#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 681#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1816#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 791#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1800#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 692#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 722#(= ~ok~0 1), Black: 799#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 916#true, Black: 793#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2018#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 1297#(and (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1295#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1311#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1227#(= ~ok~0 1), Black: 1303#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1170#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1309#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1247#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1307#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (< ~i~0 ~N~0) (= ~ok~0 1)), Black: 1184#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 1044#true, 183#true, 2252#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), 2332#true, Black: 1567#(= ~ok~0 1), Black: 1636#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1642#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1544#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1632#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1)), Black: 620#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 161#L104-2true, Black: 630#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 612#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 1087#(and (<= ~i~0 2) (<= 3 ~N~0)), Black: 628#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 622#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 548#(= ~ok~0 1), Black: 848#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 618#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (+ ~start~0 1) ~end~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 813#true, Black: 841#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 815#(not (<= ~N~0 ~i~0)), Black: 642#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 636#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 919#(<= ~end~0 (+ ~start~0 1)), Black: 918#(= ~start~0 ~end~0), Black: 2376#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 2335#(and (= ~i~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)), 926#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= ~N~0 ~i~0))), 1323#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1863#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1834#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (and (or (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 5) (<= ~end~0 3)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1963#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1892#(= ~ok~0 1), Black: 1845#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 1965#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), 357#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1885#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1971#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 185#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 1967#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 395#(or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 428#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 426#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 422#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 198#(= ~ok~0 1), Black: 440#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 420#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 444#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 413#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 1983#true, Black: 1473#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1361#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1471#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (= ~last~0 ~v_old~0) (not (<= ~start~0 2))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1405#(= ~ok~0 1), Black: 1481#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1493#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1489#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1477#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1))]) [2022-12-13 10:57:39,233 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 10:57:39,233 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:57:39,233 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:57:39,233 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:57:39,301 INFO L130 PetriNetUnfolder]: 7823/17361 cut-off events. [2022-12-13 10:57:39,301 INFO L131 PetriNetUnfolder]: For 673327/675030 co-relation queries the response was YES. [2022-12-13 10:57:39,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191506 conditions, 17361 events. 7823/17361 cut-off events. For 673327/675030 co-relation queries the response was YES. Maximal size of possible extension queue 1545. Compared 186393 event pairs, 1680 based on Foata normal form. 312/16583 useless extension candidates. Maximal degree in co-relation 190494. Up to 5856 conditions per place. [2022-12-13 10:57:39,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 1495 transitions, 44686 flow [2022-12-13 10:57:39,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 6208 [2022-12-13 10:57:39,648 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:57:39,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4502 [2022-12-13 10:57:39,649 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 1495 transitions, 44686 flow [2022-12-13 10:57:39,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 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-13 10:57:39,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:39,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:39,656 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-13 10:57:39,849 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,SelfDestructingSolverStorable22 [2022-12-13 10:57:39,850 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-13 10:57:39,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash -787412064, now seen corresponding path program 1 times [2022-12-13 10:57:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:39,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752160881] [2022-12-13 10:57:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:57:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752160881] [2022-12-13 10:57:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752160881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:57:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524728542] [2022-12-13 10:57:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:39,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:57:39,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:57:39,900 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-13 10:57:39,902 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-13 10:57:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:40,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:57:40,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:57:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:57:40,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:57:40,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524728542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:40,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:57:40,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:57:40,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599036006] [2022-12-13 10:57:40,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:40,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:57:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:57:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:57:40,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:57:40,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 1495 transitions, 44686 flow. Second operand has 5 states, 5 states have (on average 4.2) 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-13 10:57:40,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:40,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:57:40,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:51,072 INFO L130 PetriNetUnfolder]: 15057/26176 cut-off events. [2022-12-13 10:57:51,077 INFO L131 PetriNetUnfolder]: For 1129415/1129415 co-relation queries the response was YES. [2022-12-13 10:57:51,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306262 conditions, 26176 events. 15057/26176 cut-off events. For 1129415/1129415 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 221212 event pairs, 5350 based on Foata normal form. 118/26156 useless extension candidates. Maximal degree in co-relation 304721. Up to 25730 conditions per place. [2022-12-13 10:57:51,549 INFO L137 encePairwiseOnDemand]: 44/57 looper letters, 1343 selfloop transitions, 8 changer transitions 63/1414 dead transitions. [2022-12-13 10:57:51,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1414 transitions, 44574 flow [2022-12-13 10:57:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:57:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:57:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-13 10:57:51,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2807017543859649 [2022-12-13 10:57:51,551 INFO L175 Difference]: Start difference. First operand has 265 places, 1495 transitions, 44686 flow. Second operand 5 states and 80 transitions. [2022-12-13 10:57:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1414 transitions, 44574 flow [2022-12-13 10:57:59,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1414 transitions, 44253 flow, removed 82 selfloop flow, removed 3 redundant places. [2022-12-13 10:57:59,925 INFO L231 Difference]: Finished difference. Result has 267 places, 1351 transitions, 40017 flow [2022-12-13 10:57:59,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=41114, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=40017, PETRI_PLACES=267, PETRI_TRANSITIONS=1351} [2022-12-13 10:57:59,926 INFO L295 CegarLoopForPetriNet]: 25 programPoint places, 242 predicate places. [2022-12-13 10:57:59,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:57:59,926 INFO L89 Accepts]: Start accepts. Operand has 267 places, 1351 transitions, 40017 flow [2022-12-13 10:57:59,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:57:59,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:57:59,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 1351 transitions, 40017 flow [2022-12-13 10:57:59,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 1351 transitions, 40017 flow [2022-12-13 10:58:03,249 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][1322], [Black: 212#(<= ~end~0 ~start~0), 1587#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2312#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2318#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1039#true, Black: 2300#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2314#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (<= ~queue~0.offset (+ (* ~i~0 4) ~A~0.offset)) (= ~queue~0.offset 0) (< (+ (* ~i~0 4) ~A~0.offset) (+ ~queue~0.offset 1)) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= (* ~i~0 4) 0) (= ~ok~0 1)), Black: 2220#(= ~ok~0 1), Black: 2316#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2197#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2298#(and (not (= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) 4)) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (or (not (<= ~start~0 3)) (and (<= (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) ~queue~0.offset) (<= ~queue~0.offset (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= ~n~0 4) (<= ~start~0 3)) (not (= ~A~0.base ~queue~0.base)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)), Black: 2320#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~queue~0.offset (+ (* ~i~0 4) ~A~0.offset)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (< (+ (* ~i~0 4) ~A~0.offset) (+ ~queue~0.offset 1)) (<= ~start~0 3) (< 0 (+ ~start~0 1)) (= (* ~i~0 4) 0) (= ~ok~0 1)), Black: 2308#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 2213#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_391 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4)))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* v_~i~0_391 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= ~A~0.base ~queue~0.base)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1810#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_774 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_774) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1722#(= ~ok~0 1), Black: 1689#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 681#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 791#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1816#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), Black: 1800#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (<= 1 ~N~0) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 692#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 722#(= ~ok~0 1), Black: 799#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), 916#true, Black: 793#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (<= ~start~0 1) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1297#(and (= ~start~0 ~end~0) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1295#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1311#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 1227#(= ~ok~0 1), Black: 1303#(and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1170#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1309#(and (= ~A~0.offset 0) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1247#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1307#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~v_old~0 ~last~0) (< ~i~0 ~N~0) (= ~ok~0 1)), Black: 1184#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), 1044#true, 183#true, 2252#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), 2332#true, Black: 1567#(= ~ok~0 1), 2469#(<= 0 ~i~0), Black: 1636#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1642#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1544#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= (+ ~start~0 1) ~end~0) (= ~ok~0 1)), Black: 1632#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~v_old~0 ~last~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (= ~start~0 2) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (= ~end~0 1) (<= ~start~0 0)) (= ~ok~0 1)), Black: 620#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 161#L104-2true, Black: 630#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 612#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 628#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1087#(and (<= ~i~0 2) (<= 3 ~N~0)), Black: 622#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 1) ~end~0) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 548#(= ~ok~0 1), Black: 848#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 618#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (+ ~start~0 1) ~end~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (<= (+ ~start~0 1) ~n~0) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 813#true, Black: 841#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 815#(not (<= ~N~0 ~i~0)), Black: 642#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 636#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_238 (Array Int Int))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 919#(<= ~end~0 (+ ~start~0 1)), Black: 918#(= ~start~0 ~end~0), Black: 2376#(and (<= ~i~0 1) (<= 2 ~N~0)), Black: 2335#(and (= ~i~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)), 926#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= ~N~0 ~i~0))), 1323#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 1863#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~ok~0 1)), Black: 1834#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= (+ ~start~0 1) 0) (and (or (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 5) (<= ~end~0 3)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1963#(and (= ~A~0.offset 0) (= ~i~0 0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1892#(= ~ok~0 1), Black: 1845#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (= ~i~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= ~ok~0 1)), Black: 1965#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= ~end~0 ~start~0)) (= ~ok~0 1)), 357#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (and (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1971#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 1967#(and (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~queue~0.offset 0) (< 0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 185#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 395#(or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0) (not (= (mod ~ok~0 256) 0))) (< ~start~0 0) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 428#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 426#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 422#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 440#(and (<= 0 ~start~0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 198#(= ~ok~0 1), Black: 420#(and (= ~A~0.offset 0) (<= 0 ~start~0) (= ~i~0 0) (< ~start~0 ~n~0) (exists ((~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (or (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 444#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int)) (or (< ~v_old~0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 413#(and (or (<= ~n~0 ~start~0) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (and (= (* ~start~0 4) (* ~end~0 4)) (not (< |ULTIMATE.start_main_~#t1~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~i~0 4) 0)) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 ~start~0) (< ~start~0 0) (forall ((~queue~0.base Int) (v_ArrVal_157 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~v_old~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_157) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), 1983#true, Black: 1473#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1361#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1471#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (or (<= ~n~0 3) (<= ~end~0 2)) (= ~i~0 0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (= ~last~0 ~v_old~0) (not (<= ~start~0 2))) (<= ~v_old~0 ~last~0) (= ~queue~0.offset 0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) 1073741823)) (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (not (<= ~start~0 2))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1405#(= ~ok~0 1), Black: 1481#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1493#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1489#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 1477#(and (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (= ~queue~0.offset 0) (or (and (or (<= (+ ~queue~0.offset (* ~start~0 4)) 0) (= (* ~start~0 4) 4)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1))) (= ~start~0 2)) (= ~ok~0 1)), Black: 2486#(and (<= 1 ~i~0) (<= ~N~0 1))]) [2022-12-13 10:58:03,250 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 10:58:03,250 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:58:03,250 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 10:58:03,250 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 10:58:03,323 INFO L130 PetriNetUnfolder]: 6969/15450 cut-off events. [2022-12-13 10:58:03,323 INFO L131 PetriNetUnfolder]: For 578498/580032 co-relation queries the response was YES. [2022-12-13 10:58:03,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167105 conditions, 15450 events. 6969/15450 cut-off events. For 578498/580032 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 162835 event pairs, 1497 based on Foata normal form. 281/14711 useless extension candidates. Maximal degree in co-relation 166134. Up to 5219 conditions per place. [2022-12-13 10:58:03,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 1351 transitions, 40017 flow [2022-12-13 10:58:03,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 5438 [2022-12-13 10:58:03,633 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:58:03,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3707 [2022-12-13 10:58:03,633 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1351 transitions, 40017 flow [2022-12-13 10:58:03,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) 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-13 10:58:03,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:58:03,634 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:58:03,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 10:58:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:03,834 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-13 10:58:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:58:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash 487890869, now seen corresponding path program 1 times [2022-12-13 10:58:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:58:03,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189526000] [2022-12-13 10:58:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:58:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:58:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:58:04,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189526000] [2022-12-13 10:58:04,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189526000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:58:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97319053] [2022-12-13 10:58:04,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:58:04,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:58:04,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:58:04,798 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-13 10:58:04,798 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-13 10:58:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:58:04,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 10:58:04,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:58:04,929 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 79 treesize of output 77 [2022-12-13 10:58:04,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-13 10:58:05,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:05,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 28 [2022-12-13 10:58:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:58:05,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:58:07,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:07,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 853 treesize of output 1748 [2022-12-13 10:58:07,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:07,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 570 treesize of output 692 [2022-12-13 10:58:07,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:07,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 495 treesize of output 564 [2022-12-13 10:58:07,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:58:07,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 444 Received shutdown request... [2022-12-13 11:05:55,809 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 11:05:55,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 11:05:55,820 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-13 11:05:55,820 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:05:55,822 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:05:56,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:05:56,016 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 29ms.. [2022-12-13 11:05:56,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 11:05:56,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 11:05:56,017 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:05:56,019 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:05:56,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:05:56,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:05:56 BasicIcfg [2022-12-13 11:05:56,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:05:56,021 INFO L158 Benchmark]: Toolchain (without parser) took 823308.95ms. Allocated memory was 199.2MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 175.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-12-13 11:05:56,021 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 176.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:05:56,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.00ms. Allocated memory is still 199.2MB. Free memory was 175.5MB in the beginning and 162.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 11:05:56,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.05ms. Allocated memory is still 199.2MB. Free memory was 162.4MB in the beginning and 160.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:05:56,022 INFO L158 Benchmark]: Boogie Preprocessor took 32.30ms. Allocated memory is still 199.2MB. Free memory was 160.3MB in the beginning and 158.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:05:56,022 INFO L158 Benchmark]: RCFGBuilder took 445.53ms. Allocated memory is still 199.2MB. Free memory was 158.7MB in the beginning and 134.1MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 11:05:56,022 INFO L158 Benchmark]: TraceAbstraction took 822539.10ms. Allocated memory was 199.2MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 132.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-12-13 11:05:56,024 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.09ms. Allocated memory is still 199.2MB. Free memory is still 176.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.00ms. Allocated memory is still 199.2MB. Free memory was 175.5MB in the beginning and 162.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.05ms. Allocated memory is still 199.2MB. Free memory was 162.4MB in the beginning and 160.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.30ms. Allocated memory is still 199.2MB. Free memory was 160.3MB in the beginning and 158.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 445.53ms. Allocated memory is still 199.2MB. Free memory was 158.7MB in the beginning and 134.1MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 822539.10ms. Allocated memory was 199.2MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 132.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, independent: 411, independent conditional: 0, independent unconditional: 411, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 411, independent conditional: 0, independent unconditional: 411, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 410, independent conditional: 0, independent unconditional: 410, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 426, unknown conditional: 426, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 416, Positive conditional cache size: 416, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 12, Positive conditional cache size: 12, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 12, Positive conditional cache size: 12, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 30, Positive conditional cache size: 30, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 30, Positive conditional cache size: 30, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 38 PlacesBefore, 37 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 60, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 30, Positive conditional cache size: 30, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.0s, 76 PlacesBefore, 69 PlacesAfterwards, 157 TransitionsBefore, 150 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 505, independent: 444, independent conditional: 444, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 505, independent: 417, independent conditional: 417, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 100 PlacesBefore, 97 PlacesAfterwards, 272 TransitionsBefore, 269 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 36, independent: 30, independent conditional: 30, 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): 80, Positive cache size: 63, Positive conditional cache size: 63, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 112 PlacesBefore, 111 PlacesAfterwards, 320 TransitionsBefore, 319 TransitionsAfterwards, 1130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 82, Positive cache size: 65, Positive conditional cache size: 65, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 118 PlacesBefore, 118 PlacesAfterwards, 384 TransitionsBefore, 384 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 83, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 123 PlacesBefore, 123 PlacesAfterwards, 494 TransitionsBefore, 494 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], 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): 90, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 561 TransitionsBefore, 561 TransitionsAfterwards, 2026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 90, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 562 TransitionsBefore, 562 TransitionsAfterwards, 2018 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 90, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 654 TransitionsBefore, 654 TransitionsAfterwards, 2220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 90, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 167 PlacesBefore, 166 PlacesAfterwards, 745 TransitionsBefore, 744 TransitionsAfterwards, 2654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 189 PlacesBefore, 189 PlacesAfterwards, 962 TransitionsBefore, 962 TransitionsAfterwards, 3622 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 205 PlacesBefore, 205 PlacesAfterwards, 1139 TransitionsBefore, 1139 TransitionsAfterwards, 4464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 234 PlacesBefore, 234 PlacesAfterwards, 1262 TransitionsBefore, 1262 TransitionsAfterwards, 5118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 254 PlacesBefore, 254 PlacesAfterwards, 1532 TransitionsBefore, 1532 TransitionsAfterwards, 6418 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 258 PlacesBefore, 258 PlacesAfterwards, 1556 TransitionsBefore, 1556 TransitionsAfterwards, 6494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 250 PlacesBefore, 245 PlacesAfterwards, 1165 TransitionsBefore, 1162 TransitionsAfterwards, 4682 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 12, independent: 6, independent conditional: 6, 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): 103, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 257 PlacesBefore, 257 PlacesAfterwards, 1461 TransitionsBefore, 1461 TransitionsAfterwards, 6110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 103, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 265 PlacesBefore, 265 PlacesAfterwards, 1495 TransitionsBefore, 1495 TransitionsAfterwards, 6208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 103, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 259 PlacesBefore, 259 PlacesAfterwards, 1351 TransitionsBefore, 1351 TransitionsAfterwards, 5438 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 103, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 29ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 29ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 29ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 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: 822.4s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 165.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 3179 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3179 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 380 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1050 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10405 IncrementalHoareTripleChecker+Invalid, 11866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1050 mSolverCounterUnsat, 3 mSDtfsCounter, 10405 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 406 SyntacticMatches, 13 SemanticMatches, 369 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2250 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44686occurred in iteration=23, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 88.3s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 941 ConstructedInterpolants, 81 QuantifiedInterpolants, 16556 SizeOfPredicates, 258 NumberOfNonLiveVariables, 4281 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 55 InterpolantComputations, 10 PerfectInterpolantSequences, 50/136 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