/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:13:10,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:13:10,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:13:10,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:13:10,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:13:10,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:13:10,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:13:10,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:13:10,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:13:10,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:13:10,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:13:10,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:13:10,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:13:10,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:13:10,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:13:10,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:13:10,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:13:10,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:13:10,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:13:10,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:13:10,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:13:10,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:13:10,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:13:10,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:13:10,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:13:10,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:13:10,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:13:10,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:13:10,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:13:10,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:13:10,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:13:10,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:13:10,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:13:10,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:13:10,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:13:10,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:13:10,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:13:10,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:13:10,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:13:10,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:13:10,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:13:10,071 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-VariableLbe.epf [2023-01-27 21:13:10,084 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:13:10,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:13:10,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:13:10,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:13:10,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:13:10,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:13:10,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:13:10,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:13:10,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:13:10,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:13:10,087 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 21:13:10,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:13:10,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:13:10,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:13:10,230 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:13:10,230 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:13:10,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-01-27 21:13:11,196 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:13:11,353 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:13:11,354 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-01-27 21:13:11,364 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d0f248b/adc79c58fe5047ebabfe59bcfdfcadee/FLAGa4ccc6a01 [2023-01-27 21:13:11,375 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d0f248b/adc79c58fe5047ebabfe59bcfdfcadee [2023-01-27 21:13:11,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:13:11,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:13:11,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:13:11,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:13:11,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:13:11,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c063e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11, skipping insertion in model container [2023-01-27 21:13:11,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:13:11,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:13:11,559 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2023-01-27 21:13:11,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:13:11,573 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:13:11,591 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2023-01-27 21:13:11,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:13:11,600 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:13:11,600 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:13:11,605 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:13:11,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11 WrapperNode [2023-01-27 21:13:11,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:13:11,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:13:11,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:13:11,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:13:11,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,635 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 326 [2023-01-27 21:13:11,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:13:11,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:13:11,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:13:11,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:13:11,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,656 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:13:11,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:13:11,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:13:11,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:13:11,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (1/1) ... [2023-01-27 21:13:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:13:11,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:11,702 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) [2023-01-27 21:13:11,718 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 [2023-01-27 21:13:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:13:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:13:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:13:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:13:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:13:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:13:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:13:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:13:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:13:11,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:13:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-27 21:13:11,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-27 21:13:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:13:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:13:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:13:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:13:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:13:11,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:13:11,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:13:11,758 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 21:13:11,888 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:13:11,889 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:13:12,150 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:13:12,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:13:12,279 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-27 21:13:12,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:13:12 BoogieIcfgContainer [2023-01-27 21:13:12,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:13:12,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:13:12,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:13:12,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:13:12,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:13:11" (1/3) ... [2023-01-27 21:13:12,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a42793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:13:12, skipping insertion in model container [2023-01-27 21:13:12,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:11" (2/3) ... [2023-01-27 21:13:12,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a42793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:13:12, skipping insertion in model container [2023-01-27 21:13:12,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:13:12" (3/3) ... [2023-01-27 21:13:12,289 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2023-01-27 21:13:12,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:13:12,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:13:12,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:13:12,369 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-27 21:13:12,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 237 transitions, 506 flow [2023-01-27 21:13:12,485 INFO L130 PetriNetUnfolder]: 19/233 cut-off events. [2023-01-27 21:13:12,486 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:13:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 233 events. 19/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2023-01-27 21:13:12,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 237 transitions, 506 flow [2023-01-27 21:13:12,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 221 transitions, 466 flow [2023-01-27 21:13:12,497 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:13:12,505 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 221 transitions, 466 flow [2023-01-27 21:13:12,508 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 221 transitions, 466 flow [2023-01-27 21:13:12,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 221 transitions, 466 flow [2023-01-27 21:13:12,558 INFO L130 PetriNetUnfolder]: 19/221 cut-off events. [2023-01-27 21:13:12,558 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:13:12,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 221 events. 19/221 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2023-01-27 21:13:12,561 INFO L119 LiptonReduction]: Number of co-enabled transitions 1824 [2023-01-27 21:13:19,357 INFO L134 LiptonReduction]: Checked pairs total: 3053 [2023-01-27 21:13:19,358 INFO L136 LiptonReduction]: Total number of compositions: 224 [2023-01-27 21:13:19,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:13:19,383 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=PETRI_NET, 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;@63a776ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:13:19,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 21:13:19,399 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2023-01-27 21:13:19,400 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:13:19,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:19,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:19,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:19,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1951107260, now seen corresponding path program 1 times [2023-01-27 21:13:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:19,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955206962] [2023-01-27 21:13:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:19,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955206962] [2023-01-27 21:13:19,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955206962] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:13:19,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:13:19,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:13:19,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414271488] [2023-01-27 21:13:19,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:13:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:13:19,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:13:19,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 461 [2023-01-27 21:13:19,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:19,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:19,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 461 [2023-01-27 21:13:19,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:20,411 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2023-01-27 21:13:20,412 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2023-01-27 21:13:20,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3424 events. 2592/3424 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14436 event pairs, 355 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 5848. Up to 1372 conditions per place. [2023-01-27 21:13:20,430 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2023-01-27 21:13:20,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2023-01-27 21:13:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:13:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:13:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1289 transitions. [2023-01-27 21:13:20,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660159074475777 [2023-01-27 21:13:20,446 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1289 transitions. [2023-01-27 21:13:20,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1289 transitions. [2023-01-27 21:13:20,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:20,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1289 transitions. [2023-01-27 21:13:20,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.83333333333334) internal successors, (1289), 6 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 461.0) internal successors, (3227), 7 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,463 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 461.0) internal successors, (3227), 7 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,465 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 94 flow. Second operand 6 states and 1289 transitions. [2023-01-27 21:13:20,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 387 flow [2023-01-27 21:13:20,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 84 transitions, 349 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-27 21:13:20,475 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 117 flow [2023-01-27 21:13:20,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-01-27 21:13:20,479 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-01-27 21:13:20,479 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 117 flow [2023-01-27 21:13:20,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:20,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:20,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:13:20,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:20,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1476163253, now seen corresponding path program 1 times [2023-01-27 21:13:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183579188] [2023-01-27 21:13:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:20,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183579188] [2023-01-27 21:13:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183579188] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:13:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:13:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:13:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013604638] [2023-01-27 21:13:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:20,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:13:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:13:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:13:20,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 461 [2023-01-27 21:13:20,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:20,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 461 [2023-01-27 21:13:20,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:20,898 INFO L130 PetriNetUnfolder]: 2170/3051 cut-off events. [2023-01-27 21:13:20,898 INFO L131 PetriNetUnfolder]: For 1623/1884 co-relation queries the response was YES. [2023-01-27 21:13:20,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 3051 events. 2170/3051 cut-off events. For 1623/1884 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14740 event pairs, 1340 based on Foata normal form. 514/2867 useless extension candidates. Maximal degree in co-relation 4328. Up to 2387 conditions per place. [2023-01-27 21:13:20,913 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 30 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2023-01-27 21:13:20,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 357 flow [2023-01-27 21:13:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:13:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:13:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1003 transitions. [2023-01-27 21:13:20,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351409978308026 [2023-01-27 21:13:20,916 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1003 transitions. [2023-01-27 21:13:20,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1003 transitions. [2023-01-27 21:13:20,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:20,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1003 transitions. [2023-01-27 21:13:20,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.6) internal successors, (1003), 5 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,921 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,921 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 117 flow. Second operand 5 states and 1003 transitions. [2023-01-27 21:13:20,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 357 flow [2023-01-27 21:13:20,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 21:13:20,925 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 138 flow [2023-01-27 21:13:20,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-01-27 21:13:20,925 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-01-27 21:13:20,925 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 138 flow [2023-01-27 21:13:20,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:20,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:20,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:20,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:13:20,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:20,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash -901328342, now seen corresponding path program 1 times [2023-01-27 21:13:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876269659] [2023-01-27 21:13:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876269659] [2023-01-27 21:13:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876269659] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556270977] [2023-01-27 21:13:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:21,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:21,182 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) [2023-01-27 21:13:21,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 21:13:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:21,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-27 21:13:21,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:21,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556270977] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:21,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 21:13:21,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2023-01-27 21:13:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683830386] [2023-01-27 21:13:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:21,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 21:13:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 21:13:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-01-27 21:13:21,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 461 [2023-01-27 21:13:21,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:21,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:21,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 461 [2023-01-27 21:13:21,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:22,223 INFO L130 PetriNetUnfolder]: 3646/4816 cut-off events. [2023-01-27 21:13:22,224 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2023-01-27 21:13:22,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12336 conditions, 4816 events. 3646/4816 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22465 event pairs, 115 based on Foata normal form. 72/3874 useless extension candidates. Maximal degree in co-relation 12320. Up to 1399 conditions per place. [2023-01-27 21:13:22,249 INFO L137 encePairwiseOnDemand]: 453/461 looper letters, 90 selfloop transitions, 15 changer transitions 0/108 dead transitions. [2023-01-27 21:13:22,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 544 flow [2023-01-27 21:13:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 21:13:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 21:13:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1465 transitions. [2023-01-27 21:13:22,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4539820266501394 [2023-01-27 21:13:22,252 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1465 transitions. [2023-01-27 21:13:22,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1465 transitions. [2023-01-27 21:13:22,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:22,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1465 transitions. [2023-01-27 21:13:22,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 209.28571428571428) internal successors, (1465), 7 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:22,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 461.0) internal successors, (3688), 8 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:22,259 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 461.0) internal successors, (3688), 8 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:22,260 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 138 flow. Second operand 7 states and 1465 transitions. [2023-01-27 21:13:22,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 544 flow [2023-01-27 21:13:22,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 522 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 21:13:22,265 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 232 flow [2023-01-27 21:13:22,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-01-27 21:13:22,266 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-01-27 21:13:22,266 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 232 flow [2023-01-27 21:13:22,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:22,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:22,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:22,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 21:13:22,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:22,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:22,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash 639416502, now seen corresponding path program 1 times [2023-01-27 21:13:22,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:22,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42962605] [2023-01-27 21:13:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:22,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42962605] [2023-01-27 21:13:22,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42962605] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:22,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235638802] [2023-01-27 21:13:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:22,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:22,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:22,974 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) [2023-01-27 21:13:22,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 21:13:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:23,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 51 conjunts are in the unsatisfiable core [2023-01-27 21:13:23,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:23,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:23,141 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 10 treesize of output 8 [2023-01-27 21:13:23,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 21:13:23,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:13:23,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:13:23,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:13:23,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:13:23,702 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 [2023-01-27 21:13:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:23,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:24,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:13:24,523 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 73 treesize of output 61 [2023-01-27 21:13:24,537 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 5131 treesize of output 5003 [2023-01-27 21:13:24,610 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 299 treesize of output 275 [2023-01-27 21:13:24,624 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 275 treesize of output 263 [2023-01-27 21:13:24,638 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 263 treesize of output 215 [2023-01-27 21:13:24,652 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 309 treesize of output 213 [2023-01-27 21:13:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235638802] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:25,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 28 [2023-01-27 21:13:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226196964] [2023-01-27 21:13:25,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:25,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-27 21:13:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:25,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-27 21:13:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=699, Unknown=10, NotChecked=0, Total=870 [2023-01-27 21:13:25,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 461 [2023-01-27 21:13:25,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 232 flow. Second operand has 30 states, 30 states have (on average 140.36666666666667) internal successors, (4211), 30 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:25,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:25,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 461 [2023-01-27 21:13:25,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:27,583 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] [2023-01-27 21:13:29,609 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] [2023-01-27 21:13:31,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:35,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:37,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:40,838 INFO L130 PetriNetUnfolder]: 14815/19594 cut-off events. [2023-01-27 21:13:40,838 INFO L131 PetriNetUnfolder]: For 20521/20521 co-relation queries the response was YES. [2023-01-27 21:13:40,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54543 conditions, 19594 events. 14815/19594 cut-off events. For 20521/20521 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 104137 event pairs, 1232 based on Foata normal form. 165/15112 useless extension candidates. Maximal degree in co-relation 25831. Up to 5786 conditions per place. [2023-01-27 21:13:40,959 INFO L137 encePairwiseOnDemand]: 446/461 looper letters, 293 selfloop transitions, 114 changer transitions 35/445 dead transitions. [2023-01-27 21:13:40,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 445 transitions, 2658 flow [2023-01-27 21:13:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-01-27 21:13:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-01-27 21:13:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4954 transitions. [2023-01-27 21:13:40,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32564254256228226 [2023-01-27 21:13:40,976 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4954 transitions. [2023-01-27 21:13:40,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4954 transitions. [2023-01-27 21:13:40,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:40,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4954 transitions. [2023-01-27 21:13:40,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 150.12121212121212) internal successors, (4954), 33 states have internal predecessors, (4954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:41,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 461.0) internal successors, (15674), 34 states have internal predecessors, (15674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:41,005 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 461.0) internal successors, (15674), 34 states have internal predecessors, (15674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:41,005 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 232 flow. Second operand 33 states and 4954 transitions. [2023-01-27 21:13:41,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 445 transitions, 2658 flow [2023-01-27 21:13:41,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 445 transitions, 2563 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-01-27 21:13:41,084 INFO L231 Difference]: Finished difference. Result has 102 places, 164 transitions, 1298 flow [2023-01-27 21:13:41,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1298, PETRI_PLACES=102, PETRI_TRANSITIONS=164} [2023-01-27 21:13:41,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2023-01-27 21:13:41,085 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 164 transitions, 1298 flow [2023-01-27 21:13:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 140.36666666666667) internal successors, (4211), 30 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:41,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:41,086 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:41,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 21:13:41,291 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,SelfDestructingSolverStorable3 [2023-01-27 21:13:41,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:41,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1090131735, now seen corresponding path program 2 times [2023-01-27 21:13:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840483802] [2023-01-27 21:13:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:42,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840483802] [2023-01-27 21:13:42,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840483802] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:42,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146838771] [2023-01-27 21:13:42,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:13:42,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:42,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:42,480 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) [2023-01-27 21:13:42,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 21:13:42,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:13:42,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:13:42,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-27 21:13:42,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:42,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:42,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:13:42,809 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 [2023-01-27 21:13:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:42,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:42,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:13:42,918 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 45 treesize of output 37 [2023-01-27 21:13:42,932 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 11 treesize of output 5 [2023-01-27 21:13:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:13:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146838771] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:43,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:43,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 20 [2023-01-27 21:13:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075605681] [2023-01-27 21:13:43,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:43,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-27 21:13:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-27 21:13:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=392, Unknown=5, NotChecked=0, Total=462 [2023-01-27 21:13:43,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 461 [2023-01-27 21:13:43,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 164 transitions, 1298 flow. Second operand has 22 states, 22 states have (on average 150.54545454545453) internal successors, (3312), 22 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:43,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:43,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 461 [2023-01-27 21:13:43,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:46,206 INFO L130 PetriNetUnfolder]: 20664/27437 cut-off events. [2023-01-27 21:13:46,206 INFO L131 PetriNetUnfolder]: For 68745/68787 co-relation queries the response was YES. [2023-01-27 21:13:46,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93837 conditions, 27437 events. 20664/27437 cut-off events. For 68745/68787 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 154613 event pairs, 2955 based on Foata normal form. 284/23869 useless extension candidates. Maximal degree in co-relation 89007. Up to 13004 conditions per place. [2023-01-27 21:13:46,386 INFO L137 encePairwiseOnDemand]: 451/461 looper letters, 210 selfloop transitions, 104 changer transitions 11/330 dead transitions. [2023-01-27 21:13:46,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 330 transitions, 2964 flow [2023-01-27 21:13:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 21:13:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 21:13:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2073 transitions. [2023-01-27 21:13:46,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34590355414650426 [2023-01-27 21:13:46,390 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2073 transitions. [2023-01-27 21:13:46,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2073 transitions. [2023-01-27 21:13:46,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:46,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2073 transitions. [2023-01-27 21:13:46,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 159.46153846153845) internal successors, (2073), 13 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:46,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:46,399 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:46,399 INFO L175 Difference]: Start difference. First operand has 102 places, 164 transitions, 1298 flow. Second operand 13 states and 2073 transitions. [2023-01-27 21:13:46,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 330 transitions, 2964 flow [2023-01-27 21:13:46,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 330 transitions, 2874 flow, removed 44 selfloop flow, removed 1 redundant places. [2023-01-27 21:13:46,759 INFO L231 Difference]: Finished difference. Result has 118 places, 216 transitions, 2020 flow [2023-01-27 21:13:46,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2020, PETRI_PLACES=118, PETRI_TRANSITIONS=216} [2023-01-27 21:13:46,760 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2023-01-27 21:13:46,760 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 216 transitions, 2020 flow [2023-01-27 21:13:46,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 150.54545454545453) internal successors, (3312), 22 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:46,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:46,761 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:46,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 21:13:46,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:46,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:46,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 575406659, now seen corresponding path program 3 times [2023-01-27 21:13:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:46,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948078271] [2023-01-27 21:13:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948078271] [2023-01-27 21:13:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948078271] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516477289] [2023-01-27 21:13:47,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:13:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:47,869 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) [2023-01-27 21:13:47,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 21:13:48,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 21:13:48,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:13:48,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-27 21:13:48,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:48,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:48,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:13:48,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:48,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:13:48,450 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 [2023-01-27 21:13:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:48,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:48,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_336 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_337) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2023-01-27 21:13:48,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:13:48,558 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 87 treesize of output 79 [2023-01-27 21:13:48,561 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 68 treesize of output 56 [2023-01-27 21:13:48,565 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 30 treesize of output 24 [2023-01-27 21:13:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-01-27 21:13:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516477289] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:48,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2023-01-27 21:13:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784049825] [2023-01-27 21:13:48,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:48,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 21:13:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 21:13:48,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=390, Unknown=7, NotChecked=40, Total=506 [2023-01-27 21:13:48,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 461 [2023-01-27 21:13:48,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 216 transitions, 2020 flow. Second operand has 23 states, 23 states have (on average 154.2173913043478) internal successors, (3547), 23 states have internal predecessors, (3547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:48,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:48,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 461 [2023-01-27 21:13:48,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:52,640 INFO L130 PetriNetUnfolder]: 24768/32880 cut-off events. [2023-01-27 21:13:52,640 INFO L131 PetriNetUnfolder]: For 114068/114110 co-relation queries the response was YES. [2023-01-27 21:13:52,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122297 conditions, 32880 events. 24768/32880 cut-off events. For 114068/114110 co-relation queries the response was YES. Maximal size of possible extension queue 1621. Compared 190649 event pairs, 4174 based on Foata normal form. 3/28288 useless extension candidates. Maximal degree in co-relation 117995. Up to 13155 conditions per place. [2023-01-27 21:13:52,873 INFO L137 encePairwiseOnDemand]: 452/461 looper letters, 214 selfloop transitions, 123 changer transitions 11/353 dead transitions. [2023-01-27 21:13:52,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 353 transitions, 3563 flow [2023-01-27 21:13:52,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 21:13:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 21:13:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2110 transitions. [2023-01-27 21:13:52,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35207742366093775 [2023-01-27 21:13:52,878 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2110 transitions. [2023-01-27 21:13:52,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2110 transitions. [2023-01-27 21:13:52,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:52,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2110 transitions. [2023-01-27 21:13:52,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 162.30769230769232) internal successors, (2110), 13 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:52,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:52,887 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 461.0) internal successors, (6454), 14 states have internal predecessors, (6454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:52,887 INFO L175 Difference]: Start difference. First operand has 118 places, 216 transitions, 2020 flow. Second operand 13 states and 2110 transitions. [2023-01-27 21:13:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 353 transitions, 3563 flow [2023-01-27 21:13:53,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 353 transitions, 3515 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-01-27 21:13:53,734 INFO L231 Difference]: Finished difference. Result has 128 places, 240 transitions, 2516 flow [2023-01-27 21:13:53,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2516, PETRI_PLACES=128, PETRI_TRANSITIONS=240} [2023-01-27 21:13:53,735 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2023-01-27 21:13:53,735 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 240 transitions, 2516 flow [2023-01-27 21:13:53,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.2173913043478) internal successors, (3547), 23 states have internal predecessors, (3547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:53,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:53,736 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:53,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-27 21:13:53,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:53,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:13:53,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1461208083, now seen corresponding path program 4 times [2023-01-27 21:13:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324573680] [2023-01-27 21:13:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324573680] [2023-01-27 21:13:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324573680] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460454334] [2023-01-27 21:13:54,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 21:13:54,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:54,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:54,857 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) [2023-01-27 21:13:54,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 21:13:54,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 21:13:54,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:13:54,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 46 conjunts are in the unsatisfiable core [2023-01-27 21:13:54,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:55,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:55,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:13:55,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:55,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:13:55,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:13:55,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:13:55,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-01-27 21:13:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:55,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:58,016 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 21:13:58,016 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 341 treesize of output 321 [2023-01-27 21:13:58,031 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 78 treesize of output 72 [2023-01-27 21:13:58,035 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 146 treesize of output 134 [2023-01-27 21:13:58,039 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 134 treesize of output 110 [2023-01-27 21:13:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460454334] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:58,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:58,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 32 [2023-01-27 21:13:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198868732] [2023-01-27 21:13:58,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:58,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-27 21:13:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-27 21:13:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=964, Unknown=7, NotChecked=0, Total=1122 [2023-01-27 21:13:58,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 461 [2023-01-27 21:13:58,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 240 transitions, 2516 flow. Second operand has 34 states, 34 states have (on average 143.1764705882353) internal successors, (4868), 34 states have internal predecessors, (4868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:13:58,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:58,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 461 [2023-01-27 21:13:58,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:14:01,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:14:22,013 INFO L130 PetriNetUnfolder]: 67113/88678 cut-off events. [2023-01-27 21:14:22,013 INFO L131 PetriNetUnfolder]: For 354069/354199 co-relation queries the response was YES. [2023-01-27 21:14:22,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349383 conditions, 88678 events. 67113/88678 cut-off events. For 354069/354199 co-relation queries the response was YES. Maximal size of possible extension queue 4492. Compared 576654 event pairs, 4924 based on Foata normal form. 67/76296 useless extension candidates. Maximal degree in co-relation 344846. Up to 16827 conditions per place. [2023-01-27 21:14:22,887 INFO L137 encePairwiseOnDemand]: 443/461 looper letters, 512 selfloop transitions, 520 changer transitions 30/1065 dead transitions. [2023-01-27 21:14:22,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 1065 transitions, 10862 flow [2023-01-27 21:14:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-27 21:14:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-01-27 21:14:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6641 transitions. [2023-01-27 21:14:22,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3350148817030722 [2023-01-27 21:14:22,896 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6641 transitions. [2023-01-27 21:14:22,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6641 transitions. [2023-01-27 21:14:22,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:14:22,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6641 transitions. [2023-01-27 21:14:22,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 154.4418604651163) internal successors, (6641), 43 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:22,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 461.0) internal successors, (20284), 44 states have internal predecessors, (20284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:22,923 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 461.0) internal successors, (20284), 44 states have internal predecessors, (20284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:22,923 INFO L175 Difference]: Start difference. First operand has 128 places, 240 transitions, 2516 flow. Second operand 43 states and 6641 transitions. [2023-01-27 21:14:22,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 1065 transitions, 10862 flow [2023-01-27 21:14:28,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1065 transitions, 10566 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-01-27 21:14:28,707 INFO L231 Difference]: Finished difference. Result has 183 places, 628 transitions, 8542 flow [2023-01-27 21:14:28,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=8542, PETRI_PLACES=183, PETRI_TRANSITIONS=628} [2023-01-27 21:14:28,707 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2023-01-27 21:14:28,707 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 628 transitions, 8542 flow [2023-01-27 21:14:28,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 143.1764705882353) internal successors, (4868), 34 states have internal predecessors, (4868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:28,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:14:28,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:14:28,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 21:14:28,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:28,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:14:28,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:14:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash 110372441, now seen corresponding path program 1 times [2023-01-27 21:14:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:14:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481847938] [2023-01-27 21:14:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:14:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:14:29,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:14:29,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481847938] [2023-01-27 21:14:29,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481847938] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:14:29,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:14:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:14:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976691151] [2023-01-27 21:14:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:14:29,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:14:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:14:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:14:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:14:29,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 461 [2023-01-27 21:14:29,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 628 transitions, 8542 flow. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:29,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:14:29,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 461 [2023-01-27 21:14:29,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:14:33,782 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] L59-->L59: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (<= 0 v_~q1_back~0_68) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (select (select |v_#memory_int_109| v_~q1~0.base_33) (+ (* 4 v_~q1_back~0_68) v_~q1~0.offset_33)) v_~C~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (< v_~q1_back~0_68 v_~n1~0_28) |v_thread1_#t~short2#1_51| (= (+ 1 v_~q1_back~0_68) v_~q1_back~0_67) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_16| 256) 0)) (= (ite |v_thread1_#t~short2#1_52| 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (= (ite (= (ite (< v_~i~0_56 v_~N~0_20) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_15|)) InVars {~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_57, ~C~0=v_~C~0_35, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_28, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_16|} OutVars{thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_7|, ~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_56, ~C~0=v_~C~0_35, ~n1~0=v_~n1~0_28, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_7|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, ~q1_back~0=v_~q1_back~0_67, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_9|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[|v_thread1_#t~short2#1_51|, |v_thread1_#t~short2#1_52|] AssignedVars[thread1Thread1of1ForFork1_#t~short2#1, ~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][253], [395#(< ~q1_front~0 ~q1_back~0), 118#L95true, Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 448#true, 720#true, 191#L77true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 1490#true, Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), 1179#true, Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:33,782 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,782 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L95-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= v_~total~0_60 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= (select (select |v_#memory_int_93| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_59) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483647) (not (= (ite (and (< v_~q1_front~0_51 v_~q1_back~0_61) (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_61, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_60} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_50, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_59, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_61, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][255], [584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), 16#L92true, 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 720#true, 191#L77true, 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 1490#true, Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:33,783 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,784 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,784 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,791 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] L59-->L59: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (<= 0 v_~q1_back~0_68) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (select (select |v_#memory_int_109| v_~q1~0.base_33) (+ (* 4 v_~q1_back~0_68) v_~q1~0.offset_33)) v_~C~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (< v_~q1_back~0_68 v_~n1~0_28) |v_thread1_#t~short2#1_51| (= (+ 1 v_~q1_back~0_68) v_~q1_back~0_67) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_16| 256) 0)) (= (ite |v_thread1_#t~short2#1_52| 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (= (ite (= (ite (< v_~i~0_56 v_~N~0_20) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_15|)) InVars {~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_57, ~C~0=v_~C~0_35, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_28, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_16|} OutVars{thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_7|, ~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_56, ~C~0=v_~C~0_35, ~n1~0=v_~n1~0_28, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_7|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, ~q1_back~0=v_~q1_back~0_67, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_9|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[|v_thread1_#t~short2#1_51|, |v_thread1_#t~short2#1_52|] AssignedVars[thread1Thread1of1ForFork1_#t~short2#1, ~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][253], [395#(< ~q1_front~0 ~q1_back~0), 118#L95true, Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 43#thread2EXITtrue, 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 448#true, 720#true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 1490#true, Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), 1179#true, Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:33,791 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,791 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,791 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,791 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L95-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= v_~total~0_60 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= (select (select |v_#memory_int_93| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_59) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483647) (not (= (ite (and (< v_~q1_front~0_51 v_~q1_back~0_61) (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_61, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_60} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_50, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_59, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_61, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][255], [584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), 16#L92true, 43#thread2EXITtrue, 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), 112#L110true, Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 720#true, 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 1490#true, Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:33,792 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,792 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:33,792 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 21:14:33,792 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:14:37,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] L59-->L59: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (<= 0 v_~q1_back~0_68) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (select (select |v_#memory_int_109| v_~q1~0.base_33) (+ (* 4 v_~q1_back~0_68) v_~q1~0.offset_33)) v_~C~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (< v_~q1_back~0_68 v_~n1~0_28) |v_thread1_#t~short2#1_51| (= (+ 1 v_~q1_back~0_68) v_~q1_back~0_67) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_16| 256) 0)) (= (ite |v_thread1_#t~short2#1_52| 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (= (ite (= (ite (< v_~i~0_56 v_~N~0_20) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_15|)) InVars {~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_57, ~C~0=v_~C~0_35, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_28, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_16|} OutVars{thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_7|, ~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_56, ~C~0=v_~C~0_35, ~n1~0=v_~n1~0_28, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_7|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, ~q1_back~0=v_~q1_back~0_67, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_9|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[|v_thread1_#t~short2#1_51|, |v_thread1_#t~short2#1_52|] AssignedVars[thread1Thread1of1ForFork1_#t~short2#1, ~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][253], [395#(< ~q1_front~0 ~q1_back~0), 118#L95true, Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 61#thread4EXITtrue, 448#true, 720#true, 191#L77true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 1490#true, Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), 1179#true, Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:37,101 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,101 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,102 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,102 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,102 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L95-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= v_~total~0_60 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= (select (select |v_#memory_int_93| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_59) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483647) (not (= (ite (and (< v_~q1_front~0_51 v_~q1_back~0_61) (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_61, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_60} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_50, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_59, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_61, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][255], [584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), 16#L92true, 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 61#thread4EXITtrue, 720#true, 191#L77true, 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 1490#true, Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:37,102 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,102 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,102 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,102 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([955] L59-->L59: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (<= 0 v_~q1_back~0_68) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (select (select |v_#memory_int_109| v_~q1~0.base_33) (+ (* 4 v_~q1_back~0_68) v_~q1~0.offset_33)) v_~C~0_35) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (< v_~q1_back~0_68 v_~n1~0_28) |v_thread1_#t~short2#1_51| (= (+ 1 v_~q1_back~0_68) v_~q1_back~0_67) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_16| 256) 0)) (= (ite |v_thread1_#t~short2#1_52| 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (= (ite (= (ite (< v_~i~0_56 v_~N~0_20) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_15|)) InVars {~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_57, ~C~0=v_~C~0_35, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_28, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_16|} OutVars{thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_7|, ~q1~0.offset=v_~q1~0.offset_33, ~i~0=v_~i~0_56, ~C~0=v_~C~0_35, ~n1~0=v_~n1~0_28, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_7|, ~N~0=v_~N~0_20, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, ~q1_back~0=v_~q1_back~0_67, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_109|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_9|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[|v_thread1_#t~short2#1_51|, |v_thread1_#t~short2#1_52|] AssignedVars[thread1Thread1of1ForFork1_#t~short2#1, ~i~0, thread1Thread1of1ForFork1_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][253], [395#(< ~q1_front~0 ~q1_back~0), 118#L95true, Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 43#thread2EXITtrue, 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 61#thread4EXITtrue, 448#true, 720#true, Black: 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 1490#true, Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), 1179#true, Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:37,108 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,108 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,108 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,108 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L95-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= v_~total~0_60 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= (select (select |v_#memory_int_93| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_59) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_5| 2147483647) (not (= (ite (and (< v_~q1_front~0_51 v_~q1_back~0_61) (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_61, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_60} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_50, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_59, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_61, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][255], [584#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1176#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1451#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), 16#L92true, 43#thread2EXITtrue, 125#L59true, Black: 749#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 941#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 771#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 943#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 937#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_front~0 0)) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 123#L144-1true, Black: 673#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 424#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 1465#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 442#(and (< ~q1_front~0 ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 691#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1434#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 438#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 529#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0))), Black: 687#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 695#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1463#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 675#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1449#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1428#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_407) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), 240#(and (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= 1 ~N~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1188#(<= 1 ~total~0), Black: 595#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< ~q1_front~0 ~n1~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~n1~0 2)), Black: 697#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1453#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1461#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 683#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< ~q1_back~0 0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 455#(<= 1 ~total~0), Black: 1443#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1328#(or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 679#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 681#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), Black: 1349#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1436#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 599#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1457#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (forall ((v_ArrVal_408 (Array Int Int))) (< 0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_408) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 629#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))), Black: 689#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 1 ~C~0)), Black: 1445#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 693#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1335#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1321#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 653#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_back~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (<= ~n1~0 ~q1_back~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< ~q1_back~0 0) (< 0 (+ (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_198) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0))))), Black: 1420#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 1441#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 61#thread4EXITtrue, 720#true, 440#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 1490#true, Black: 238#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 237#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 247#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2023-01-27 21:14:37,109 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,109 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-27 21:14:37,109 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:37,109 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-27 21:14:43,685 INFO L130 PetriNetUnfolder]: 63851/89910 cut-off events. [2023-01-27 21:14:43,685 INFO L131 PetriNetUnfolder]: For 912803/920234 co-relation queries the response was YES. [2023-01-27 21:14:44,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442991 conditions, 89910 events. 63851/89910 cut-off events. For 912803/920234 co-relation queries the response was YES. Maximal size of possible extension queue 4863. Compared 677614 event pairs, 34285 based on Foata normal form. 6543/86077 useless extension candidates. Maximal degree in co-relation 436331. Up to 57896 conditions per place. [2023-01-27 21:14:44,960 INFO L137 encePairwiseOnDemand]: 456/461 looper letters, 624 selfloop transitions, 14 changer transitions 85/778 dead transitions. [2023-01-27 21:14:44,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 778 transitions, 12411 flow [2023-01-27 21:14:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:14:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:14:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 799 transitions. [2023-01-27 21:14:44,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43329718004338397 [2023-01-27 21:14:44,962 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 799 transitions. [2023-01-27 21:14:44,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 799 transitions. [2023-01-27 21:14:44,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:14:44,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 799 transitions. [2023-01-27 21:14:44,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:44,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:44,967 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:14:44,967 INFO L175 Difference]: Start difference. First operand has 183 places, 628 transitions, 8542 flow. Second operand 4 states and 799 transitions. [2023-01-27 21:14:44,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 778 transitions, 12411 flow [2023-01-27 21:15:01,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 778 transitions, 11510 flow, removed 419 selfloop flow, removed 8 redundant places. [2023-01-27 21:15:01,722 INFO L231 Difference]: Finished difference. Result has 180 places, 572 transitions, 7608 flow [2023-01-27 21:15:01,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=7425, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7608, PETRI_PLACES=180, PETRI_TRANSITIONS=572} [2023-01-27 21:15:01,726 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2023-01-27 21:15:01,726 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 572 transitions, 7608 flow [2023-01-27 21:15:01,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:01,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:01,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:01,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 21:15:01,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:15:01,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:01,727 INFO L85 PathProgramCache]: Analyzing trace with hash 154686599, now seen corresponding path program 1 times [2023-01-27 21:15:01,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:01,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912638240] [2023-01-27 21:15:01,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:01,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:15:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912638240] [2023-01-27 21:15:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912638240] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:15:01,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:15:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:15:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486529240] [2023-01-27 21:15:01,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:15:01,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:15:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:01,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:15:01,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:15:01,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 461 [2023-01-27 21:15:01,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 572 transitions, 7608 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:01,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:01,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 461 [2023-01-27 21:15:01,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:21,657 INFO L130 PetriNetUnfolder]: 89903/126160 cut-off events. [2023-01-27 21:15:21,657 INFO L131 PetriNetUnfolder]: For 1256777/1268229 co-relation queries the response was YES. [2023-01-27 21:15:23,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579317 conditions, 126160 events. 89903/126160 cut-off events. For 1256777/1268229 co-relation queries the response was YES. Maximal size of possible extension queue 6183. Compared 946549 event pairs, 34211 based on Foata normal form. 8805/133202 useless extension candidates. Maximal degree in co-relation 574737. Up to 65290 conditions per place. [2023-01-27 21:15:23,667 INFO L137 encePairwiseOnDemand]: 458/461 looper letters, 708 selfloop transitions, 11 changer transitions 3/775 dead transitions. [2023-01-27 21:15:23,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 775 transitions, 11910 flow [2023-01-27 21:15:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:15:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:15:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2023-01-27 21:15:23,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48083875632682577 [2023-01-27 21:15:23,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 665 transitions. [2023-01-27 21:15:23,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 665 transitions. [2023-01-27 21:15:23,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:23,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 665 transitions. [2023-01-27 21:15:23,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:23,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 461.0) internal successors, (1844), 4 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:23,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 461.0) internal successors, (1844), 4 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:23,670 INFO L175 Difference]: Start difference. First operand has 180 places, 572 transitions, 7608 flow. Second operand 3 states and 665 transitions. [2023-01-27 21:15:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 775 transitions, 11910 flow [2023-01-27 21:15:43,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 775 transitions, 11888 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-27 21:15:43,514 INFO L231 Difference]: Finished difference. Result has 182 places, 574 transitions, 7937 flow [2023-01-27 21:15:43,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=7590, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7937, PETRI_PLACES=182, PETRI_TRANSITIONS=574} [2023-01-27 21:15:43,515 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2023-01-27 21:15:43,515 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 574 transitions, 7937 flow [2023-01-27 21:15:43,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:43,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:43,516 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:43,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 21:15:43,516 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:15:43,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -468702043, now seen corresponding path program 5 times [2023-01-27 21:15:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075895064] [2023-01-27 21:15:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 21:15:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075895064] [2023-01-27 21:15:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075895064] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653901119] [2023-01-27 21:15:43,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 21:15:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:15:43,716 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) [2023-01-27 21:15:43,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 21:15:43,829 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 21:15:43,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:15:43,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-27 21:15:43,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:15:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 21:15:43,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:15:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 21:15:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653901119] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:15:44,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:15:44,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2023-01-27 21:15:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269519632] [2023-01-27 21:15:44,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:15:44,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-27 21:15:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-27 21:15:44,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-01-27 21:15:44,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 461 [2023-01-27 21:15:44,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 574 transitions, 7937 flow. Second operand has 18 states, 18 states have (on average 201.0) internal successors, (3618), 18 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:15:44,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:44,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 461 [2023-01-27 21:15:44,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:16:05,084 INFO L130 PetriNetUnfolder]: 93876/131796 cut-off events. [2023-01-27 21:16:05,084 INFO L131 PetriNetUnfolder]: For 1005663/1005749 co-relation queries the response was YES. [2023-01-27 21:16:06,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656296 conditions, 131796 events. 93876/131796 cut-off events. For 1005663/1005749 co-relation queries the response was YES. Maximal size of possible extension queue 6143. Compared 1021035 event pairs, 7376 based on Foata normal form. 2384/133900 useless extension candidates. Maximal degree in co-relation 656237. Up to 40664 conditions per place. [2023-01-27 21:16:07,170 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 731 selfloop transitions, 394 changer transitions 5/1133 dead transitions. [2023-01-27 21:16:07,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1133 transitions, 16006 flow [2023-01-27 21:16:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-27 21:16:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-27 21:16:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4661 transitions. [2023-01-27 21:16:07,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595740485111418 [2023-01-27 21:16:07,175 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4661 transitions. [2023-01-27 21:16:07,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4661 transitions. [2023-01-27 21:16:07,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:16:07,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4661 transitions. [2023-01-27 21:16:07,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 211.86363636363637) internal successors, (4661), 22 states have internal predecessors, (4661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:16:07,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 461.0) internal successors, (10603), 23 states have internal predecessors, (10603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:16:07,188 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 461.0) internal successors, (10603), 23 states have internal predecessors, (10603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:16:07,188 INFO L175 Difference]: Start difference. First operand has 182 places, 574 transitions, 7937 flow. Second operand 22 states and 4661 transitions. [2023-01-27 21:16:07,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1133 transitions, 16006 flow [2023-01-27 21:16:55,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1133 transitions, 15278 flow, removed 317 selfloop flow, removed 6 redundant places. [2023-01-27 21:16:55,172 INFO L231 Difference]: Finished difference. Result has 204 places, 674 transitions, 10233 flow [2023-01-27 21:16:55,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=7215, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=10233, PETRI_PLACES=204, PETRI_TRANSITIONS=674} [2023-01-27 21:16:55,173 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2023-01-27 21:16:55,173 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 674 transitions, 10233 flow [2023-01-27 21:16:55,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 201.0) internal successors, (3618), 18 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:16:55,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:16:55,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:16:55,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 21:16:55,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:16:55,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:16:55,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:16:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -599658537, now seen corresponding path program 1 times [2023-01-27 21:16:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:16:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086614075] [2023-01-27 21:16:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:16:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:16:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:16:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:16:55,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:16:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086614075] [2023-01-27 21:16:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086614075] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:16:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017693794] [2023-01-27 21:16:55,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:16:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:16:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:16:55,720 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) [2023-01-27 21:16:55,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 21:16:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:16:55,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-27 21:16:55,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:16:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:16:56,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:16:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:16:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017693794] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:16:56,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:16:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 23 [2023-01-27 21:16:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906318818] [2023-01-27 21:16:56,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:16:56,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-27 21:16:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:16:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-27 21:16:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2023-01-27 21:16:56,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 461 [2023-01-27 21:16:56,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 674 transitions, 10233 flow. Second operand has 24 states, 24 states have (on average 189.79166666666666) internal successors, (4555), 24 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:16:56,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:16:56,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 461 [2023-01-27 21:16:56,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand