./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:23:24,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:23:24,361 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 19:23:24,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:23:24,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:23:24,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:23:24,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:23:24,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:23:24,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:23:24,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:23:24,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:23:24,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:23:24,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:23:24,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:23:24,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:23:24,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:23:24,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:23:24,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:23:24,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:23:24,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:23:24,422 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:23:24,422 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:23:24,423 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:23:24,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:23:24,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:23:24,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:23:24,425 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:23:24,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:23:24,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:23:24,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:23:24,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:23:24,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:23:24,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:23:24,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:24,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:23:24,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:23:24,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:23:24,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:23:24,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:23:24,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:23:24,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:23:24,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:23:24,436 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2024-11-08 19:23:24,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:23:24,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:23:24,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:23:24,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:23:24,784 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:23:24,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c Unable to find full path for "g++" [2024-11-08 19:23:27,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:23:27,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:23:27,257 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2024-11-08 19:23:27,267 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/data/391040886/c0cc8774ddde496ab2d375544419c385/FLAGe0948a140 [2024-11-08 19:23:27,284 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/data/391040886/c0cc8774ddde496ab2d375544419c385 [2024-11-08 19:23:27,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:23:27,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:23:27,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:27,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:23:27,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:23:27,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769d95b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27, skipping insertion in model container [2024-11-08 19:23:27,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:23:27,548 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 19:23:27,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:27,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:23:27,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:27,611 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:23:27,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27 WrapperNode [2024-11-08 19:23:27,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:27,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:27,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:23:27,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:23:27,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,652 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-08 19:23:27,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:27,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:23:27,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:23:27,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:23:27,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,690 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-08 19:23:27,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:23:27,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:23:27,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:23:27,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:23:27,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (1/1) ... [2024-11-08 19:23:27,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:27,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:27,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:23:27,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:23:27,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:23:27,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 19:23:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 19:23:27,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 19:23:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 19:23:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 19:23:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 19:23:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:23:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 19:23:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 19:23:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 19:23:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 19:23:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 19:23:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 19:23:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:23:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:23:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 19:23:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 19:23:27,784 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 19:23:27,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:23:27,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:23:28,265 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:23:28,265 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:23:28,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:23:28,657 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:23:28,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:28 BoogieIcfgContainer [2024-11-08 19:23:28,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:23:28,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:23:28,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:23:28,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:23:28,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:23:27" (1/3) ... [2024-11-08 19:23:28,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe97333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:28, skipping insertion in model container [2024-11-08 19:23:28,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:27" (2/3) ... [2024-11-08 19:23:28,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe97333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:28, skipping insertion in model container [2024-11-08 19:23:28,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:28" (3/3) ... [2024-11-08 19:23:28,672 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2024-11-08 19:23:28,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:23:28,688 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-08 19:23:28,688 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:23:28,783 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 19:23:28,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 145 flow [2024-11-08 19:23:28,898 INFO L124 PetriNetUnfolderBase]: 8/59 cut-off events. [2024-11-08 19:23:28,899 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 19:23:28,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 8/59 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-08 19:23:28,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 62 transitions, 145 flow [2024-11-08 19:23:28,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 58 transitions, 134 flow [2024-11-08 19:23:28,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:23:28,930 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@30e5642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:23:28,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-08 19:23:28,937 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:23:28,937 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2024-11-08 19:23:28,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:23:28,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:28,939 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 19:23:28,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:28,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash 14400585, now seen corresponding path program 1 times [2024-11-08 19:23:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:28,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657760113] [2024-11-08 19:23:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657760113] [2024-11-08 19:23:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657760113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 19:23:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268096900] [2024-11-08 19:23:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:29,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2024-11-08 19:23:29,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:29,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:29,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2024-11-08 19:23:29,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:29,873 INFO L124 PetriNetUnfolderBase]: 1403/2228 cut-off events. [2024-11-08 19:23:29,873 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-08 19:23:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4241 conditions, 2228 events. 1403/2228 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 13435 event pairs, 1060 based on Foata normal form. 1/1512 useless extension candidates. Maximal degree in co-relation 3932. Up to 1877 conditions per place. [2024-11-08 19:23:29,905 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 30 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-11-08 19:23:29,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 180 flow [2024-11-08 19:23:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:23:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:23:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-08 19:23:29,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2024-11-08 19:23:29,924 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 134 flow. Second operand 3 states and 103 transitions. [2024-11-08 19:23:29,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 180 flow [2024-11-08 19:23:29,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 19:23:29,940 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 108 flow [2024-11-08 19:23:29,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2024-11-08 19:23:29,948 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -13 predicate places. [2024-11-08 19:23:29,949 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 108 flow [2024-11-08 19:23:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:29,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:29,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 19:23:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:23:29,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 14400586, now seen corresponding path program 1 times [2024-11-08 19:23:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:29,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513778937] [2024-11-08 19:23:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513778937] [2024-11-08 19:23:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513778937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:23:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227093588] [2024-11-08 19:23:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:30,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:23:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:23:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:23:30,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-11-08 19:23:30,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:30,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:30,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-11-08 19:23:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:30,892 INFO L124 PetriNetUnfolderBase]: 1405/2235 cut-off events. [2024-11-08 19:23:30,892 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-08 19:23:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 2235 events. 1405/2235 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 13512 event pairs, 1060 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 4138. Up to 1886 conditions per place. [2024-11-08 19:23:30,909 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 38 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-11-08 19:23:30,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 212 flow [2024-11-08 19:23:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:23:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 19:23:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-08 19:23:30,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-11-08 19:23:30,914 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 108 flow. Second operand 4 states and 116 transitions. [2024-11-08 19:23:30,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 212 flow [2024-11-08 19:23:30,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:23:30,917 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 136 flow [2024-11-08 19:23:30,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2024-11-08 19:23:30,920 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2024-11-08 19:23:30,920 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 136 flow [2024-11-08 19:23:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:30,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:30,921 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2024-11-08 19:23:30,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:23:30,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:30,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash -488383885, now seen corresponding path program 1 times [2024-11-08 19:23:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433369446] [2024-11-08 19:23:30,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:31,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433369446] [2024-11-08 19:23:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433369446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:31,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437793148] [2024-11-08 19:23:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:31,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:31,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:31,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:23:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:31,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 19:23:31,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:31,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-08 19:23:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:31,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437793148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:32,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-08 19:23:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825095699] [2024-11-08 19:23:32,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:23:32,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:23:32,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:23:32,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-11-08 19:23:32,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 136 flow. Second operand has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:32,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:32,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-11-08 19:23:32,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:32,956 INFO L124 PetriNetUnfolderBase]: 1405/2235 cut-off events. [2024-11-08 19:23:32,957 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-08 19:23:32,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4186 conditions, 2235 events. 1405/2235 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 13470 event pairs, 1060 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 4147. Up to 1880 conditions per place. [2024-11-08 19:23:32,976 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 34 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2024-11-08 19:23:32,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 228 flow [2024-11-08 19:23:32,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:23:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:23:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-11-08 19:23:32,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-11-08 19:23:32,981 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 136 flow. Second operand 6 states and 152 transitions. [2024-11-08 19:23:32,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 228 flow [2024-11-08 19:23:32,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 19:23:32,984 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 154 flow [2024-11-08 19:23:32,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2024-11-08 19:23:32,986 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-11-08 19:23:32,988 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 154 flow [2024-11-08 19:23:32,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:32,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:32,989 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:33,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:23:33,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:33,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:33,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 855597803, now seen corresponding path program 1 times [2024-11-08 19:23:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:33,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758734352] [2024-11-08 19:23:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758734352] [2024-11-08 19:23:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758734352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:33,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:23:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854566144] [2024-11-08 19:23:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:33,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:23:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:33,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:23:33,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:23:33,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2024-11-08 19:23:33,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:33,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:33,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2024-11-08 19:23:33,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:33,535 INFO L124 PetriNetUnfolderBase]: 857/1397 cut-off events. [2024-11-08 19:23:33,535 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-08 19:23:33,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1397 events. 857/1397 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7657 event pairs, 608 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 2556. Up to 1137 conditions per place. [2024-11-08 19:23:33,547 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 28 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2024-11-08 19:23:33,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 214 flow [2024-11-08 19:23:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:23:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 19:23:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-08 19:23:33,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-11-08 19:23:33,551 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 154 flow. Second operand 4 states and 116 transitions. [2024-11-08 19:23:33,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 214 flow [2024-11-08 19:23:33,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 185 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-08 19:23:33,554 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 129 flow [2024-11-08 19:23:33,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2024-11-08 19:23:33,555 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2024-11-08 19:23:33,555 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 129 flow [2024-11-08 19:23:33,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:33,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:33,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:33,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:23:33,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:33,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 855597804, now seen corresponding path program 1 times [2024-11-08 19:23:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551874986] [2024-11-08 19:23:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551874986] [2024-11-08 19:23:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551874986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:23:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312604564] [2024-11-08 19:23:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:33,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:23:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:23:33,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:23:33,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 62 [2024-11-08 19:23:33,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:33,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:33,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 62 [2024-11-08 19:23:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:33,871 INFO L124 PetriNetUnfolderBase]: 855/1395 cut-off events. [2024-11-08 19:23:33,871 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-08 19:23:33,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 1395 events. 855/1395 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7608 event pairs, 608 based on Foata normal form. 2/1059 useless extension candidates. Maximal degree in co-relation 2546. Up to 1141 conditions per place. [2024-11-08 19:23:33,881 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 32 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-08 19:23:33,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 197 flow [2024-11-08 19:23:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:23:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 19:23:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-08 19:23:33,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-11-08 19:23:33,883 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 129 flow. Second operand 4 states and 116 transitions. [2024-11-08 19:23:33,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 197 flow [2024-11-08 19:23:33,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:23:33,885 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 125 flow [2024-11-08 19:23:33,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-11-08 19:23:33,886 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2024-11-08 19:23:33,886 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 125 flow [2024-11-08 19:23:33,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:33,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:33,887 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:23:33,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:33,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2047493269, now seen corresponding path program 1 times [2024-11-08 19:23:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750023195] [2024-11-08 19:23:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:33,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750023195] [2024-11-08 19:23:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750023195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780583002] [2024-11-08 19:23:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:34,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:34,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:34,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:34,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:23:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:34,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 19:23:34,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:34,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:34,370 INFO L378 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 22 treesize of output 18 [2024-11-08 19:23:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780583002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:34,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:34,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-11-08 19:23:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654689480] [2024-11-08 19:23:34,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:34,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:23:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:23:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:23:34,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 62 [2024-11-08 19:23:34,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 125 flow. Second operand has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:34,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:34,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 62 [2024-11-08 19:23:34,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:35,056 INFO L124 PetriNetUnfolderBase]: 1261/2073 cut-off events. [2024-11-08 19:23:35,056 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-08 19:23:35,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 2073 events. 1261/2073 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11922 event pairs, 483 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 3735. Up to 988 conditions per place. [2024-11-08 19:23:35,071 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 56 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-11-08 19:23:35,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 327 flow [2024-11-08 19:23:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:23:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:23:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-11-08 19:23:35,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5046082949308756 [2024-11-08 19:23:35,073 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 125 flow. Second operand 7 states and 219 transitions. [2024-11-08 19:23:35,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 327 flow [2024-11-08 19:23:35,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:23:35,078 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 161 flow [2024-11-08 19:23:35,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=161, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-08 19:23:35,080 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-11-08 19:23:35,082 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 161 flow [2024-11-08 19:23:35,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:35,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:35,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:35,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:23:35,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:35,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:35,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash -877828335, now seen corresponding path program 1 times [2024-11-08 19:23:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470764620] [2024-11-08 19:23:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470764620] [2024-11-08 19:23:35,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470764620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202563625] [2024-11-08 19:23:35,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:35,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:35,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:23:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:35,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:23:35,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:35,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:35,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202563625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:35,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 19:23:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433689586] [2024-11-08 19:23:35,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:35,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:23:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:35,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:23:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:23:35,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:23:35,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 161 flow. Second operand has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:35,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:35,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:23:35,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:36,726 INFO L124 PetriNetUnfolderBase]: 2863/4338 cut-off events. [2024-11-08 19:23:36,726 INFO L125 PetriNetUnfolderBase]: For 2299/2299 co-relation queries the response was YES. [2024-11-08 19:23:36,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10114 conditions, 4338 events. 2863/4338 cut-off events. For 2299/2299 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 24707 event pairs, 1527 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 6821. Up to 2246 conditions per place. [2024-11-08 19:23:36,769 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 94 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2024-11-08 19:23:36,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 119 transitions, 617 flow [2024-11-08 19:23:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:23:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 19:23:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-11-08 19:23:36,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-08 19:23:36,772 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 161 flow. Second operand 10 states and 248 transitions. [2024-11-08 19:23:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 119 transitions, 617 flow [2024-11-08 19:23:36,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 609 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 19:23:36,779 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 255 flow [2024-11-08 19:23:36,783 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=255, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-11-08 19:23:36,784 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2024-11-08 19:23:36,784 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 255 flow [2024-11-08 19:23:36,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:36,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:36,785 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:36,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:23:36,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:36,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1620867018, now seen corresponding path program 1 times [2024-11-08 19:23:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:36,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473062299] [2024-11-08 19:23:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:37,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473062299] [2024-11-08 19:23:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473062299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344081657] [2024-11-08 19:23:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:37,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:37,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:37,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:37,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:23:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:37,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 19:23:37,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:37,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:23:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344081657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:37,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:23:37,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-08 19:23:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861140466] [2024-11-08 19:23:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:37,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:23:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:23:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:23:37,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 62 [2024-11-08 19:23:37,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:37,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:37,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 62 [2024-11-08 19:23:37,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:38,498 INFO L124 PetriNetUnfolderBase]: 2772/4673 cut-off events. [2024-11-08 19:23:38,499 INFO L125 PetriNetUnfolderBase]: For 2908/2908 co-relation queries the response was YES. [2024-11-08 19:23:38,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11006 conditions, 4673 events. 2772/4673 cut-off events. For 2908/2908 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 30262 event pairs, 1344 based on Foata normal form. 0/3931 useless extension candidates. Maximal degree in co-relation 6893. Up to 2635 conditions per place. [2024-11-08 19:23:38,544 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 56 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2024-11-08 19:23:38,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 464 flow [2024-11-08 19:23:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:23:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:23:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-11-08 19:23:38,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4774193548387097 [2024-11-08 19:23:38,546 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 255 flow. Second operand 5 states and 148 transitions. [2024-11-08 19:23:38,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 464 flow [2024-11-08 19:23:38,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 456 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-08 19:23:38,565 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 276 flow [2024-11-08 19:23:38,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-11-08 19:23:38,568 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2024-11-08 19:23:38,568 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 276 flow [2024-11-08 19:23:38,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:38,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:38,568 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:38,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 19:23:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:38,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash 747358289, now seen corresponding path program 1 times [2024-11-08 19:23:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787691548] [2024-11-08 19:23:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:38,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787691548] [2024-11-08 19:23:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787691548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:38,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702462304] [2024-11-08 19:23:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:38,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:38,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:38,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 19:23:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:38,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:23:38,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:39,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702462304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:39,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 19:23:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261561250] [2024-11-08 19:23:39,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:39,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:23:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:39,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:23:39,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:23:39,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:23:39,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 276 flow. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:39,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:39,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:23:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:40,236 INFO L124 PetriNetUnfolderBase]: 4326/6607 cut-off events. [2024-11-08 19:23:40,237 INFO L125 PetriNetUnfolderBase]: For 4146/4146 co-relation queries the response was YES. [2024-11-08 19:23:40,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16476 conditions, 6607 events. 4326/6607 cut-off events. For 4146/4146 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 39854 event pairs, 2130 based on Foata normal form. 0/5445 useless extension candidates. Maximal degree in co-relation 11586. Up to 3394 conditions per place. [2024-11-08 19:23:40,367 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 120 selfloop transitions, 20 changer transitions 0/150 dead transitions. [2024-11-08 19:23:40,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 150 transitions, 866 flow [2024-11-08 19:23:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:23:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 19:23:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 290 transitions. [2024-11-08 19:23:40,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-11-08 19:23:40,369 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 276 flow. Second operand 11 states and 290 transitions. [2024-11-08 19:23:40,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 150 transitions, 866 flow [2024-11-08 19:23:40,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 150 transitions, 838 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 19:23:40,381 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 351 flow [2024-11-08 19:23:40,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=351, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-11-08 19:23:40,383 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2024-11-08 19:23:40,384 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 351 flow [2024-11-08 19:23:40,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:40,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:40,384 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:40,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 19:23:40,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:40,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1839867656, now seen corresponding path program 2 times [2024-11-08 19:23:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804004633] [2024-11-08 19:23:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804004633] [2024-11-08 19:23:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804004633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50654758] [2024-11-08 19:23:40,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:23:40,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:40,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:40,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:40,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 19:23:40,914 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 19:23:40,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:23:40,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 19:23:40,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:40,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-08 19:23:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 19:23:41,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:23:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50654758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:41,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:23:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2024-11-08 19:23:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016943327] [2024-11-08 19:23:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:23:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:23:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:23:41,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-11-08 19:23:41,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:41,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:41,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-11-08 19:23:41,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:42,533 INFO L124 PetriNetUnfolderBase]: 3661/5518 cut-off events. [2024-11-08 19:23:42,533 INFO L125 PetriNetUnfolderBase]: For 7765/7801 co-relation queries the response was YES. [2024-11-08 19:23:42,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16094 conditions, 5518 events. 3661/5518 cut-off events. For 7765/7801 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 31428 event pairs, 698 based on Foata normal form. 0/5210 useless extension candidates. Maximal degree in co-relation 11622. Up to 1748 conditions per place. [2024-11-08 19:23:42,588 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 80 selfloop transitions, 12 changer transitions 0/111 dead transitions. [2024-11-08 19:23:42,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 111 transitions, 743 flow [2024-11-08 19:23:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:23:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:23:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-11-08 19:23:42,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2024-11-08 19:23:42,590 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 351 flow. Second operand 6 states and 170 transitions. [2024-11-08 19:23:42,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 111 transitions, 743 flow [2024-11-08 19:23:42,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 726 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-08 19:23:42,612 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 363 flow [2024-11-08 19:23:42,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-11-08 19:23:42,614 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2024-11-08 19:23:42,615 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 363 flow [2024-11-08 19:23:42,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:42,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:42,615 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:42,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 19:23:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:42,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1113089672, now seen corresponding path program 2 times [2024-11-08 19:23:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201047380] [2024-11-08 19:23:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201047380] [2024-11-08 19:23:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201047380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515754994] [2024-11-08 19:23:43,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:23:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:43,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:43,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 19:23:43,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:23:43,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:23:43,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 19:23:43,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:43,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:43,450 INFO L378 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 24 treesize of output 20 [2024-11-08 19:23:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515754994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:43,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-11-08 19:23:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976059685] [2024-11-08 19:23:43,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:43,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:23:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:23:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:23:43,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 62 [2024-11-08 19:23:43,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 363 flow. Second operand has 20 states, 20 states have (on average 23.65) internal successors, (473), 20 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:43,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:43,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 62 [2024-11-08 19:23:43,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:45,115 INFO L124 PetriNetUnfolderBase]: 3335/5530 cut-off events. [2024-11-08 19:23:45,115 INFO L125 PetriNetUnfolderBase]: For 10129/11414 co-relation queries the response was YES. [2024-11-08 19:23:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16185 conditions, 5530 events. 3335/5530 cut-off events. For 10129/11414 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 34469 event pairs, 933 based on Foata normal form. 71/5183 useless extension candidates. Maximal degree in co-relation 9037. Up to 1634 conditions per place. [2024-11-08 19:23:45,175 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 123 selfloop transitions, 20 changer transitions 0/167 dead transitions. [2024-11-08 19:23:45,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 167 transitions, 1054 flow [2024-11-08 19:23:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:23:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 19:23:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 335 transitions. [2024-11-08 19:23:45,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-11-08 19:23:45,177 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 363 flow. Second operand 10 states and 335 transitions. [2024-11-08 19:23:45,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 167 transitions, 1054 flow [2024-11-08 19:23:45,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 167 transitions, 1022 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 19:23:45,195 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 484 flow [2024-11-08 19:23:45,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=484, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2024-11-08 19:23:45,196 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2024-11-08 19:23:45,196 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 484 flow [2024-11-08 19:23:45,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 23.65) internal successors, (473), 20 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:45,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:45,197 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:45,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 19:23:45,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 19:23:45,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:45,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1271045894, now seen corresponding path program 1 times [2024-11-08 19:23:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532860376] [2024-11-08 19:23:45,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:45,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532860376] [2024-11-08 19:23:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532860376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373735206] [2024-11-08 19:23:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:45,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:45,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 19:23:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:45,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:23:45,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:45,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:45,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373735206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:45,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-08 19:23:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140250482] [2024-11-08 19:23:45,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:45,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:23:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:23:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:23:46,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:23:46,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 484 flow. Second operand has 15 states, 15 states have (on average 17.733333333333334) internal successors, (266), 15 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:46,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:46,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:23:46,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:47,089 INFO L124 PetriNetUnfolderBase]: 4901/7031 cut-off events. [2024-11-08 19:23:47,090 INFO L125 PetriNetUnfolderBase]: For 24902/27239 co-relation queries the response was YES. [2024-11-08 19:23:47,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24310 conditions, 7031 events. 4901/7031 cut-off events. For 24902/27239 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37546 event pairs, 2138 based on Foata normal form. 6/6531 useless extension candidates. Maximal degree in co-relation 15604. Up to 3686 conditions per place. [2024-11-08 19:23:47,158 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 115 selfloop transitions, 21 changer transitions 0/149 dead transitions. [2024-11-08 19:23:47,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 149 transitions, 1209 flow [2024-11-08 19:23:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:23:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 19:23:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2024-11-08 19:23:47,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-11-08 19:23:47,161 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 484 flow. Second operand 11 states and 266 transitions. [2024-11-08 19:23:47,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 149 transitions, 1209 flow [2024-11-08 19:23:47,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 149 transitions, 1169 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-08 19:23:47,186 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 548 flow [2024-11-08 19:23:47,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=548, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2024-11-08 19:23:47,187 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 39 predicate places. [2024-11-08 19:23:47,187 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 548 flow [2024-11-08 19:23:47,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.733333333333334) internal successors, (266), 15 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:47,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:47,188 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:47,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 19:23:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:47,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash -62801724, now seen corresponding path program 3 times [2024-11-08 19:23:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598549698] [2024-11-08 19:23:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:23:47,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598549698] [2024-11-08 19:23:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598549698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92177405] [2024-11-08 19:23:47,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 19:23:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:47,528 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:47,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 19:23:47,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 19:23:47,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:23:47,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 19:23:47,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:23:47,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:48,055 INFO L378 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 13 treesize of output 11 [2024-11-08 19:23:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:23:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92177405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:48,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2024-11-08 19:23:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195882128] [2024-11-08 19:23:48,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 19:23:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 19:23:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:23:48,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:23:48,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 548 flow. Second operand has 22 states, 22 states have (on average 17.454545454545453) internal successors, (384), 22 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:48,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:48,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:23:48,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:52,477 INFO L124 PetriNetUnfolderBase]: 9320/13374 cut-off events. [2024-11-08 19:23:52,477 INFO L125 PetriNetUnfolderBase]: For 27929/32732 co-relation queries the response was YES. [2024-11-08 19:23:52,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45294 conditions, 13374 events. 9320/13374 cut-off events. For 27929/32732 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 79307 event pairs, 1516 based on Foata normal form. 153/13428 useless extension candidates. Maximal degree in co-relation 24969. Up to 2181 conditions per place. [2024-11-08 19:23:52,617 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 354 selfloop transitions, 59 changer transitions 0/426 dead transitions. [2024-11-08 19:23:52,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 426 transitions, 3075 flow [2024-11-08 19:23:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:23:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-08 19:23:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 622 transitions. [2024-11-08 19:23:52,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4361851332398317 [2024-11-08 19:23:52,621 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 548 flow. Second operand 23 states and 622 transitions. [2024-11-08 19:23:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 426 transitions, 3075 flow [2024-11-08 19:23:52,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 426 transitions, 3055 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 19:23:52,781 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 932 flow [2024-11-08 19:23:52,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=932, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2024-11-08 19:23:52,783 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 60 predicate places. [2024-11-08 19:23:52,783 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 932 flow [2024-11-08 19:23:52,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 17.454545454545453) internal successors, (384), 22 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:52,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:52,785 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:52,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 19:23:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 19:23:52,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:52,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1360480701, now seen corresponding path program 2 times [2024-11-08 19:23:52,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:52,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952593299] [2024-11-08 19:23:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:23:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952593299] [2024-11-08 19:23:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952593299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971328690] [2024-11-08 19:23:53,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:23:53,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:53,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:53,318 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:53,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 19:23:53,415 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:23:53,415 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:23:53,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 19:23:53,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:53,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2024-11-08 19:23:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 19:23:53,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 19:23:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971328690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:54,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2024-11-08 19:23:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354557967] [2024-11-08 19:23:54,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:54,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:23:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:23:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:23:54,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:23:54,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 932 flow. Second operand has 19 states, 19 states have (on average 18.05263157894737) internal successors, (343), 19 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:54,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:54,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:23:54,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:56,761 INFO L124 PetriNetUnfolderBase]: 6582/9785 cut-off events. [2024-11-08 19:23:56,761 INFO L125 PetriNetUnfolderBase]: For 52480/56312 co-relation queries the response was YES. [2024-11-08 19:23:56,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40016 conditions, 9785 events. 6582/9785 cut-off events. For 52480/56312 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 59185 event pairs, 1079 based on Foata normal form. 751/10449 useless extension candidates. Maximal degree in co-relation 22221. Up to 3372 conditions per place. [2024-11-08 19:23:56,851 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 185 selfloop transitions, 15 changer transitions 0/225 dead transitions. [2024-11-08 19:23:56,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 225 transitions, 2458 flow [2024-11-08 19:23:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:23:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:23:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-11-08 19:23:56,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-11-08 19:23:56,853 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 932 flow. Second operand 7 states and 178 transitions. [2024-11-08 19:23:56,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 225 transitions, 2458 flow [2024-11-08 19:23:56,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 225 transitions, 2289 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-11-08 19:23:56,958 INFO L231 Difference]: Finished difference. Result has 120 places, 109 transitions, 882 flow [2024-11-08 19:23:56,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=882, PETRI_PLACES=120, PETRI_TRANSITIONS=109} [2024-11-08 19:23:56,959 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 60 predicate places. [2024-11-08 19:23:56,959 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 109 transitions, 882 flow [2024-11-08 19:23:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.05263157894737) internal successors, (343), 19 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:56,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:56,960 INFO L204 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] [2024-11-08 19:23:56,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 19:23:57,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 19:23:57,165 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:57,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1567865817, now seen corresponding path program 1 times [2024-11-08 19:23:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102103900] [2024-11-08 19:23:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:23:57,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:57,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102103900] [2024-11-08 19:23:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102103900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:57,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13473222] [2024-11-08 19:23:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:57,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:57,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:57,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:57,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 19:23:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:57,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:23:57,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:23:57,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:23:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13473222] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:57,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:23:57,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-08 19:23:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663031123] [2024-11-08 19:23:57,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:57,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:23:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:23:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:23:57,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:23:57,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 109 transitions, 882 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:57,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:23:57,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:23:57,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:23:58,942 INFO L124 PetriNetUnfolderBase]: 6261/9747 cut-off events. [2024-11-08 19:23:58,942 INFO L125 PetriNetUnfolderBase]: For 34820/38192 co-relation queries the response was YES. [2024-11-08 19:23:59,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36558 conditions, 9747 events. 6261/9747 cut-off events. For 34820/38192 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 62047 event pairs, 2502 based on Foata normal form. 664/10245 useless extension candidates. Maximal degree in co-relation 23303. Up to 4878 conditions per place. [2024-11-08 19:23:59,145 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 83 selfloop transitions, 17 changer transitions 0/111 dead transitions. [2024-11-08 19:23:59,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 1041 flow [2024-11-08 19:23:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:23:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:23:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-11-08 19:23:59,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-08 19:23:59,148 INFO L175 Difference]: Start difference. First operand has 120 places, 109 transitions, 882 flow. Second operand 5 states and 124 transitions. [2024-11-08 19:23:59,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 1041 flow [2024-11-08 19:23:59,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 111 transitions, 989 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-11-08 19:23:59,218 INFO L231 Difference]: Finished difference. Result has 113 places, 91 transitions, 721 flow [2024-11-08 19:23:59,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=721, PETRI_PLACES=113, PETRI_TRANSITIONS=91} [2024-11-08 19:23:59,219 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 53 predicate places. [2024-11-08 19:23:59,219 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 91 transitions, 721 flow [2024-11-08 19:23:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:23:59,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:23:59,219 INFO L204 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] [2024-11-08 19:23:59,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 19:23:59,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 19:23:59,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:23:59,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2095913693, now seen corresponding path program 1 times [2024-11-08 19:23:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:59,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127757751] [2024-11-08 19:23:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:00,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127757751] [2024-11-08 19:24:00,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127757751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553061936] [2024-11-08 19:24:00,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:00,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:00,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 19:24:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 19:24:00,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:00,170 INFO L378 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 15 treesize of output 1 [2024-11-08 19:24:00,542 INFO L378 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 85 treesize of output 61 [2024-11-08 19:24:00,546 INFO L378 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 61 treesize of output 57 [2024-11-08 19:24:00,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2024-11-08 19:24:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:00,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:00,981 INFO L378 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 135 treesize of output 131 [2024-11-08 19:24:00,987 INFO L378 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 131 treesize of output 127 [2024-11-08 19:24:02,915 INFO L378 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 100 treesize of output 92 [2024-11-08 19:24:02,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:02,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 118 [2024-11-08 19:24:03,412 INFO L378 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 117 treesize of output 105 [2024-11-08 19:24:03,436 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 19:24:03,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-11-08 19:24:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553061936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:03,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:03,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-08 19:24:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256232592] [2024-11-08 19:24:03,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:03,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 19:24:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:03,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 19:24:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-11-08 19:24:04,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:24:04,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 91 transitions, 721 flow. Second operand has 25 states, 25 states have (on average 17.92) internal successors, (448), 25 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:04,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:04,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:24:04,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:09,290 INFO L124 PetriNetUnfolderBase]: 6471/10374 cut-off events. [2024-11-08 19:24:09,291 INFO L125 PetriNetUnfolderBase]: For 40282/43050 co-relation queries the response was YES. [2024-11-08 19:24:09,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40577 conditions, 10374 events. 6471/10374 cut-off events. For 40282/43050 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 69504 event pairs, 1624 based on Foata normal form. 8/10288 useless extension candidates. Maximal degree in co-relation 29755. Up to 6663 conditions per place. [2024-11-08 19:24:09,374 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 159 selfloop transitions, 64 changer transitions 75/311 dead transitions. [2024-11-08 19:24:09,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 311 transitions, 2797 flow [2024-11-08 19:24:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 19:24:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-11-08 19:24:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 697 transitions. [2024-11-08 19:24:09,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36264308012486995 [2024-11-08 19:24:09,380 INFO L175 Difference]: Start difference. First operand has 113 places, 91 transitions, 721 flow. Second operand 31 states and 697 transitions. [2024-11-08 19:24:09,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 311 transitions, 2797 flow [2024-11-08 19:24:09,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 311 transitions, 2709 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-08 19:24:09,507 INFO L231 Difference]: Finished difference. Result has 145 places, 142 transitions, 1289 flow [2024-11-08 19:24:09,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1289, PETRI_PLACES=145, PETRI_TRANSITIONS=142} [2024-11-08 19:24:09,508 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 85 predicate places. [2024-11-08 19:24:09,509 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 1289 flow [2024-11-08 19:24:09,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 17.92) internal successors, (448), 25 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:09,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:09,509 INFO L204 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] [2024-11-08 19:24:09,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 19:24:09,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 19:24:09,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:24:09,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1840977155, now seen corresponding path program 2 times [2024-11-08 19:24:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002910118] [2024-11-08 19:24:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002910118] [2024-11-08 19:24:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002910118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848572983] [2024-11-08 19:24:10,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:24:10,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:10,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:10,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:10,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 19:24:10,470 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:24:10,470 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:24:10,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 19:24:10,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:10,525 INFO L378 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 15 treesize of output 1 [2024-11-08 19:24:11,025 INFO L378 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 75 treesize of output 51 [2024-11-08 19:24:11,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-08 19:24:11,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-08 19:24:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:11,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:11,406 INFO L378 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 135 treesize of output 131 [2024-11-08 19:24:11,409 INFO L378 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 131 treesize of output 127 [2024-11-08 19:24:12,798 INFO L378 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 100 treesize of output 92 [2024-11-08 19:24:12,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:12,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 118 [2024-11-08 19:24:13,705 INFO L378 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 117 treesize of output 105 [2024-11-08 19:24:13,718 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 19:24:13,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-11-08 19:24:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848572983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:13,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2024-11-08 19:24:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443535792] [2024-11-08 19:24:13,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:13,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 19:24:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 19:24:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-11-08 19:24:14,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:24:14,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 1289 flow. Second operand has 24 states, 24 states have (on average 18.083333333333332) internal successors, (434), 24 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:14,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:14,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:24:14,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:19,118 INFO L124 PetriNetUnfolderBase]: 6471/10548 cut-off events. [2024-11-08 19:24:19,118 INFO L125 PetriNetUnfolderBase]: For 40472/43288 co-relation queries the response was YES. [2024-11-08 19:24:19,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42553 conditions, 10548 events. 6471/10548 cut-off events. For 40472/43288 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 71845 event pairs, 1089 based on Foata normal form. 24/10510 useless extension candidates. Maximal degree in co-relation 42490. Up to 7070 conditions per place. [2024-11-08 19:24:19,200 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 158 selfloop transitions, 48 changer transitions 107/326 dead transitions. [2024-11-08 19:24:19,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 326 transitions, 3080 flow [2024-11-08 19:24:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 19:24:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-08 19:24:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 608 transitions. [2024-11-08 19:24:19,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3771712158808933 [2024-11-08 19:24:19,354 INFO L175 Difference]: Start difference. First operand has 145 places, 142 transitions, 1289 flow. Second operand 26 states and 608 transitions. [2024-11-08 19:24:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 326 transitions, 3080 flow [2024-11-08 19:24:19,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 326 transitions, 3037 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-11-08 19:24:19,456 INFO L231 Difference]: Finished difference. Result has 167 places, 152 transitions, 1534 flow [2024-11-08 19:24:19,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1534, PETRI_PLACES=167, PETRI_TRANSITIONS=152} [2024-11-08 19:24:19,457 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 107 predicate places. [2024-11-08 19:24:19,457 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 152 transitions, 1534 flow [2024-11-08 19:24:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.083333333333332) internal successors, (434), 24 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:19,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:19,457 INFO L204 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] [2024-11-08 19:24:19,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 19:24:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 19:24:19,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:24:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1721536293, now seen corresponding path program 3 times [2024-11-08 19:24:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940484711] [2024-11-08 19:24:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:20,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:20,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940484711] [2024-11-08 19:24:20,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940484711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:20,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638553807] [2024-11-08 19:24:20,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 19:24:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:20,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:20,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 19:24:20,294 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 19:24:20,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:24:20,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 19:24:20,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:20,351 INFO L378 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 15 treesize of output 1 [2024-11-08 19:24:20,784 INFO L378 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 75 treesize of output 51 [2024-11-08 19:24:20,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-08 19:24:20,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-08 19:24:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:20,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:21,107 INFO L378 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 135 treesize of output 131 [2024-11-08 19:24:21,110 INFO L378 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 131 treesize of output 127 [2024-11-08 19:24:22,368 INFO L378 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 100 treesize of output 92 [2024-11-08 19:24:22,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:22,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 118 [2024-11-08 19:24:23,138 INFO L378 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 117 treesize of output 105 [2024-11-08 19:24:23,152 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-08 19:24:23,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2024-11-08 19:24:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638553807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:23,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2024-11-08 19:24:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262644433] [2024-11-08 19:24:23,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:23,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 19:24:23,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 19:24:23,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-11-08 19:24:24,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:24:24,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 152 transitions, 1534 flow. Second operand has 24 states, 24 states have (on average 18.166666666666668) internal successors, (436), 24 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:24,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:24,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:24:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:29,603 INFO L124 PetriNetUnfolderBase]: 6290/10208 cut-off events. [2024-11-08 19:24:29,603 INFO L125 PetriNetUnfolderBase]: For 48033/50873 co-relation queries the response was YES. [2024-11-08 19:24:29,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43253 conditions, 10208 events. 6290/10208 cut-off events. For 48033/50873 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 68943 event pairs, 1227 based on Foata normal form. 80/10220 useless extension candidates. Maximal degree in co-relation 43174. Up to 6751 conditions per place. [2024-11-08 19:24:29,663 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 191 selfloop transitions, 55 changer transitions 81/340 dead transitions. [2024-11-08 19:24:29,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 340 transitions, 3540 flow [2024-11-08 19:24:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 19:24:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-11-08 19:24:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 700 transitions. [2024-11-08 19:24:29,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36420395421436 [2024-11-08 19:24:29,666 INFO L175 Difference]: Start difference. First operand has 167 places, 152 transitions, 1534 flow. Second operand 31 states and 700 transitions. [2024-11-08 19:24:29,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 340 transitions, 3540 flow [2024-11-08 19:24:29,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 340 transitions, 3381 flow, removed 58 selfloop flow, removed 15 redundant places. [2024-11-08 19:24:29,856 INFO L231 Difference]: Finished difference. Result has 176 places, 155 transitions, 1688 flow [2024-11-08 19:24:29,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1688, PETRI_PLACES=176, PETRI_TRANSITIONS=155} [2024-11-08 19:24:29,857 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 116 predicate places. [2024-11-08 19:24:29,857 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 155 transitions, 1688 flow [2024-11-08 19:24:29,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.166666666666668) internal successors, (436), 24 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:29,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:29,858 INFO L204 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] [2024-11-08 19:24:29,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 19:24:30,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 19:24:30,058 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:24:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -98785597, now seen corresponding path program 4 times [2024-11-08 19:24:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362432951] [2024-11-08 19:24:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362432951] [2024-11-08 19:24:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362432951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563409981] [2024-11-08 19:24:30,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 19:24:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:30,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:30,591 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:30,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 19:24:30,680 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 19:24:30,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:24:30,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 19:24:30,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:30,733 INFO L378 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 15 treesize of output 1 [2024-11-08 19:24:31,155 INFO L378 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 75 treesize of output 51 [2024-11-08 19:24:31,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-08 19:24:31,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-08 19:24:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:31,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:31,429 INFO L378 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 135 treesize of output 131 [2024-11-08 19:24:31,432 INFO L378 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 131 treesize of output 127 [2024-11-08 19:24:32,752 INFO L378 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 45 treesize of output 39 [2024-11-08 19:24:32,755 INFO L378 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 56 treesize of output 50 [2024-11-08 19:24:32,772 INFO L378 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 68 treesize of output 60 [2024-11-08 19:24:32,779 INFO L378 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 82 treesize of output 74 [2024-11-08 19:24:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563409981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:32,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2024-11-08 19:24:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442129397] [2024-11-08 19:24:32,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 19:24:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 19:24:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2024-11-08 19:24:33,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:24:33,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 155 transitions, 1688 flow. Second operand has 27 states, 27 states have (on average 17.74074074074074) internal successors, (479), 27 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:33,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:33,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:24:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:38,550 INFO L124 PetriNetUnfolderBase]: 10470/17843 cut-off events. [2024-11-08 19:24:38,551 INFO L125 PetriNetUnfolderBase]: For 65440/65754 co-relation queries the response was YES. [2024-11-08 19:24:38,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71370 conditions, 17843 events. 10470/17843 cut-off events. For 65440/65754 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 136827 event pairs, 899 based on Foata normal form. 21/17790 useless extension candidates. Maximal degree in co-relation 71289. Up to 9138 conditions per place. [2024-11-08 19:24:38,743 INFO L140 encePairwiseOnDemand]: 42/62 looper letters, 278 selfloop transitions, 159 changer transitions 60/512 dead transitions. [2024-11-08 19:24:38,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 512 transitions, 5506 flow [2024-11-08 19:24:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 19:24:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-08 19:24:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 701 transitions. [2024-11-08 19:24:38,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37688172043010754 [2024-11-08 19:24:38,746 INFO L175 Difference]: Start difference. First operand has 176 places, 155 transitions, 1688 flow. Second operand 30 states and 701 transitions. [2024-11-08 19:24:38,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 512 transitions, 5506 flow [2024-11-08 19:24:39,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 512 transitions, 5179 flow, removed 48 selfloop flow, removed 16 redundant places. [2024-11-08 19:24:39,148 INFO L231 Difference]: Finished difference. Result has 201 places, 288 transitions, 3338 flow [2024-11-08 19:24:39,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3338, PETRI_PLACES=201, PETRI_TRANSITIONS=288} [2024-11-08 19:24:39,149 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 141 predicate places. [2024-11-08 19:24:39,149 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 288 transitions, 3338 flow [2024-11-08 19:24:39,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.74074074074074) internal successors, (479), 27 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:39,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:39,149 INFO L204 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] [2024-11-08 19:24:39,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 19:24:39,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:39,350 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:24:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2042408625, now seen corresponding path program 5 times [2024-11-08 19:24:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:39,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837928728] [2024-11-08 19:24:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837928728] [2024-11-08 19:24:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837928728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471267757] [2024-11-08 19:24:39,914 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 19:24:39,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:39,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:39,916 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:39,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 19:24:40,013 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-08 19:24:40,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:24:40,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 19:24:40,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:40,071 INFO L378 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 15 treesize of output 1 [2024-11-08 19:24:40,647 INFO L378 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 75 treesize of output 51 [2024-11-08 19:24:40,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-08 19:24:40,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-08 19:24:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:40,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:41,045 INFO L378 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 128 treesize of output 124 [2024-11-08 19:24:41,055 INFO L378 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 124 treesize of output 120 [2024-11-08 19:24:42,599 INFO L378 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 69 treesize of output 61 [2024-11-08 19:24:42,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:42,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2024-11-08 19:24:42,761 INFO L378 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 66 treesize of output 58 [2024-11-08 19:24:42,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:24:42,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2024-11-08 19:24:42,800 INFO L378 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 53 treesize of output 47 [2024-11-08 19:24:42,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:24:42,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2024-11-08 19:24:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471267757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:42,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-11-08 19:24:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406071015] [2024-11-08 19:24:42,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 19:24:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 19:24:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2024-11-08 19:24:43,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-11-08 19:24:43,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 288 transitions, 3338 flow. Second operand has 28 states, 28 states have (on average 14.25) internal successors, (399), 28 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:43,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:43,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-11-08 19:24:43,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:58,249 INFO L124 PetriNetUnfolderBase]: 39026/57501 cut-off events. [2024-11-08 19:24:58,249 INFO L125 PetriNetUnfolderBase]: For 372080/376500 co-relation queries the response was YES. [2024-11-08 19:24:58,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261312 conditions, 57501 events. 39026/57501 cut-off events. For 372080/376500 co-relation queries the response was YES. Maximal size of possible extension queue 1955. Compared 411064 event pairs, 4295 based on Foata normal form. 1769/58689 useless extension candidates. Maximal degree in co-relation 256298. Up to 33370 conditions per place. [2024-11-08 19:24:58,948 INFO L140 encePairwiseOnDemand]: 42/62 looper letters, 434 selfloop transitions, 410 changer transitions 94/952 dead transitions. [2024-11-08 19:24:58,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 952 transitions, 11610 flow [2024-11-08 19:24:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-08 19:24:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-11-08 19:24:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 824 transitions. [2024-11-08 19:24:58,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3090772693173293 [2024-11-08 19:24:58,952 INFO L175 Difference]: Start difference. First operand has 201 places, 288 transitions, 3338 flow. Second operand 43 states and 824 transitions. [2024-11-08 19:24:58,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 952 transitions, 11610 flow [2024-11-08 19:25:04,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 952 transitions, 10827 flow, removed 268 selfloop flow, removed 13 redundant places. [2024-11-08 19:25:04,163 INFO L231 Difference]: Finished difference. Result has 240 places, 615 transitions, 7815 flow [2024-11-08 19:25:04,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3055, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=7815, PETRI_PLACES=240, PETRI_TRANSITIONS=615} [2024-11-08 19:25:04,164 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 180 predicate places. [2024-11-08 19:25:04,164 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 615 transitions, 7815 flow [2024-11-08 19:25:04,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.25) internal successors, (399), 28 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:25:04,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:25:04,164 INFO L204 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] [2024-11-08 19:25:04,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-08 19:25:04,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:04,365 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:25:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1717771987, now seen corresponding path program 6 times [2024-11-08 19:25:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320715161] [2024-11-08 19:25:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320715161] [2024-11-08 19:25:05,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320715161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:25:05,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776245683] [2024-11-08 19:25:05,001 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 19:25:05,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:25:05,003 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:25:05,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 19:25:05,111 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-08 19:25:05,111 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:25:05,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 19:25:05,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:05,198 INFO L378 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 15 treesize of output 1 [2024-11-08 19:25:05,777 INFO L378 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 75 treesize of output 51 [2024-11-08 19:25:05,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-08 19:25:05,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-08 19:25:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:05,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:25:06,195 INFO L378 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 116 treesize of output 112 [2024-11-08 19:25:06,202 INFO L378 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 112 treesize of output 108 [2024-11-08 19:25:07,430 INFO L378 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 66 treesize of output 58 [2024-11-08 19:25:07,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 19:25:07,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 79 [2024-11-08 19:25:07,616 INFO L378 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 72 treesize of output 64 [2024-11-08 19:25:07,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:25:07,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 82 [2024-11-08 19:25:07,831 INFO L378 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 53 treesize of output 47 [2024-11-08 19:25:07,848 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 19:25:07,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 53 [2024-11-08 19:25:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776245683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:25:08,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:25:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2024-11-08 19:25:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070276970] [2024-11-08 19:25:08,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:25:08,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 19:25:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:08,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 19:25:08,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:25:09,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:25:09,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 615 transitions, 7815 flow. Second operand has 26 states, 26 states have (on average 17.96153846153846) internal successors, (467), 26 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:25:09,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:25:09,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:25:09,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:25:23,216 INFO L124 PetriNetUnfolderBase]: 23390/38040 cut-off events. [2024-11-08 19:25:23,216 INFO L125 PetriNetUnfolderBase]: For 330498/334139 co-relation queries the response was YES. [2024-11-08 19:25:23,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204734 conditions, 38040 events. 23390/38040 cut-off events. For 330498/334139 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 308982 event pairs, 2772 based on Foata normal form. 1348/38326 useless extension candidates. Maximal degree in co-relation 202166. Up to 27407 conditions per place. [2024-11-08 19:25:23,788 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 392 selfloop transitions, 166 changer transitions 129/725 dead transitions. [2024-11-08 19:25:23,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 725 transitions, 10034 flow [2024-11-08 19:25:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 19:25:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-08 19:25:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 567 transitions. [2024-11-08 19:25:23,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35173697270471466 [2024-11-08 19:25:23,790 INFO L175 Difference]: Start difference. First operand has 240 places, 615 transitions, 7815 flow. Second operand 26 states and 567 transitions. [2024-11-08 19:25:23,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 725 transitions, 10034 flow [2024-11-08 19:25:33,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 725 transitions, 9704 flow, removed 123 selfloop flow, removed 9 redundant places. [2024-11-08 19:25:33,241 INFO L231 Difference]: Finished difference. Result has 246 places, 568 transitions, 7197 flow [2024-11-08 19:25:33,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=7487, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=7197, PETRI_PLACES=246, PETRI_TRANSITIONS=568} [2024-11-08 19:25:33,242 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 186 predicate places. [2024-11-08 19:25:33,242 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 568 transitions, 7197 flow [2024-11-08 19:25:33,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 17.96153846153846) internal successors, (467), 26 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:25:33,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:25:33,243 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:33,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-08 19:25:33,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-08 19:25:33,443 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:25:33,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1409651962, now seen corresponding path program 7 times [2024-11-08 19:25:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81288627] [2024-11-08 19:25:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:25:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81288627] [2024-11-08 19:25:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81288627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:25:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959212377] [2024-11-08 19:25:33,562 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 19:25:33,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:33,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:25:33,564 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:25:33,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 19:25:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:33,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:25:33,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:25:33,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:25:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:25:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959212377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:25:33,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:25:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 19:25:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049208889] [2024-11-08 19:25:33,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:25:33,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:25:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:25:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:25:34,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 62 [2024-11-08 19:25:34,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 568 transitions, 7197 flow. Second operand has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:25:34,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:25:34,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 62 [2024-11-08 19:25:34,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:25:41,727 INFO L124 PetriNetUnfolderBase]: 20375/32158 cut-off events. [2024-11-08 19:25:41,727 INFO L125 PetriNetUnfolderBase]: For 243122/247243 co-relation queries the response was YES. [2024-11-08 19:25:41,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168247 conditions, 32158 events. 20375/32158 cut-off events. For 243122/247243 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 246038 event pairs, 1924 based on Foata normal form. 1727/33132 useless extension candidates. Maximal degree in co-relation 168181. Up to 13104 conditions per place. [2024-11-08 19:25:42,076 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 408 selfloop transitions, 77 changer transitions 122/626 dead transitions. [2024-11-08 19:25:42,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 626 transitions, 8888 flow [2024-11-08 19:25:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:25:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 19:25:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-11-08 19:25:42,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2024-11-08 19:25:42,078 INFO L175 Difference]: Start difference. First operand has 246 places, 568 transitions, 7197 flow. Second operand 9 states and 219 transitions. [2024-11-08 19:25:42,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 626 transitions, 8888 flow [2024-11-08 19:25:46,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 626 transitions, 8002 flow, removed 48 selfloop flow, removed 30 redundant places. [2024-11-08 19:25:46,492 INFO L231 Difference]: Finished difference. Result has 193 places, 406 transitions, 4485 flow [2024-11-08 19:25:46,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=5902, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4485, PETRI_PLACES=193, PETRI_TRANSITIONS=406} [2024-11-08 19:25:46,493 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 133 predicate places. [2024-11-08 19:25:46,493 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 406 transitions, 4485 flow [2024-11-08 19:25:46,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:25:46,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:25:46,493 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:46,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-08 19:25:46,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:46,694 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-08 19:25:46,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 338883004, now seen corresponding path program 8 times [2024-11-08 19:25:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210426041] [2024-11-08 19:25:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:25:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210426041] [2024-11-08 19:25:46,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210426041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:25:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010821891] [2024-11-08 19:25:46,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:25:46,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:25:46,952 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:25:46,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34b9578b-24eb-488d-8420-816d88477c1e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 19:25:47,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:25:47,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:25:47,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 19:25:47,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:25:47,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:25:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:25:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010821891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:25:47,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:25:47,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-08 19:25:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497621436] [2024-11-08 19:25:47,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:25:47,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:25:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:47,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:25:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:25:47,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2024-11-08 19:25:47,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 406 transitions, 4485 flow. Second operand has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 19 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:25:47,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:25:47,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2024-11-08 19:25:47,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:25:53,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 45#L70-2true, 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 136#(= (select |#valid| ~A~0.base) 1), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), 2158#true, Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2439#true, 976#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 8#L94-4true, 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:25:53,998 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-08 19:25:53,998 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 19:25:53,999 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 19:25:53,999 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 19:25:56,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 45#L70-2true, 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), 136#(= (select |#valid| ~A~0.base) 1), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), 2158#true, Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2439#true, 976#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 23#L95true, 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:25:56,211 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,212 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,212 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,212 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 21#L71true, Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 136#(= (select |#valid| ~A~0.base) 1), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2158#true, Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2439#true, 976#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 8#L94-4true, 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:25:56,256 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,256 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,256 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 19:25:56,257 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 19:25:58,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 21#L71true, Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), 136#(= (select |#valid| ~A~0.base) 1), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), 2158#true, Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2439#true, 976#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 23#L95true, 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:25:58,543 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-08 19:25:58,543 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-08 19:25:58,543 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-08 19:25:58,543 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-08 19:25:59,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 45#L70-2true, 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), 136#(= (select |#valid| ~A~0.base) 1), 982#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2158#true, Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2439#true, Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 8#L94-4true, 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:25:59,248 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-08 19:25:59,248 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-08 19:25:59,248 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-08 19:25:59,248 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-08 19:26:01,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 45#L70-2true, 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), 982#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), 136#(= (select |#valid| ~A~0.base) 1), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2158#true, Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 2439#true, 23#L95true, Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:26:01,107 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,107 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,108 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,108 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork1_~i~0_17 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_107))) (let ((.cse0 (= (select |v_#valid_148| v_~A~0.base_125) 1)) (.cse1 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_107 4) (select |v_#length_125| v_~A~0.base_125)))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int#1_63| v_~A~0.base_125) .cse4))) (or (and .cse0 (= v_~max1~0_54 .cse2) .cse1 (< v_~max1~0_55 .cse2) .cse3) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_55 v_~max1~0_54) (<= .cse2 v_~max1~0_55)))) .cse3)))) InVars {~max1~0=v_~max1~0_55, ~A~0.base=v_~A~0.base_125, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} OutVars{~max1~0=v_~max1~0_54, ~A~0.base=v_~A~0.base_125, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_5|, ~A~0.offset=v_~A~0.offset_107, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, #valid=|v_#valid_148|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_17, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_63|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][841], [Black: 2412#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), Black: 2189#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2202#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0)), 373#true, Black: 139#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 21#L71true, Black: 576#(and (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 1333#true, Black: 795#(and (= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 697#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (<= ~N~0 1)), Black: 797#(and (= ~N~0 1) (<= 1 thread3Thread1of1ForFork0_~i~2) (= ~M~0 0)), Black: 2592#(or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)), Black: 2704#(and (or (and (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= ~max2~0 ~max1~0))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0))), Black: 2521#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2504#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 3010#(<= 2 ~N~0), Black: 2610#(or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< ~A~0.offset 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (and (or (< ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))))) (< 1 ~N~0)), Black: 2470#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 2525#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= (select |#valid| ~A~0.base) 1) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= 4 (select |#length| ~A~0.base))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (<= thread1Thread1of1ForFork1_~i~0 1)), Black: 2676#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (or (< thread3Thread1of1ForFork0_~i~2 0) (not (= (select |#valid| ~A~0.base) 1)) (< thread1Thread1of1ForFork1_~i~0 ~N~0) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork0_~i~2 4)) 1) (< (select |#length| ~A~0.base) (+ (* thread3Thread1of1ForFork0_~i~2 4) 4)))), 3088#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1)), 136#(= (select |#valid| ~A~0.base) 1), 982#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 310#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 308#(and (<= ~N~0 1) (= ~M~0 0)), Black: 239#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2158#true, Black: 219#true, Black: 1581#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1)))), 595#(and (= thread1Thread1of1ForFork1_~i~0 1) (<= 0 ~A~0.offset) (<= (+ ~A~0.offset 8) (select |#length| ~A~0.base))), 275#(<= ~M~0 thread2Thread1of1ForFork2_~i~1), Black: 1837#(and (or (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (or (forall ((v_subst_1 Int)) (or (< (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_1) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< v_subst_1 0) (< ~N~0 (+ v_subst_1 1)))) (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= ~max2~0 0) (= ~max1~0 0) (or (and (forall ((v_subst_3 Int)) (or (< ~N~0 (+ v_subst_3 1)) (< v_subst_3 0) (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_3) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (forall ((v_subst_2 Int)) (or (< 0 (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 v_subst_2) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< v_subst_2 0) (< ~N~0 (+ v_subst_2 1))))) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (= ~M~0 0)), Black: 149#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset)), Black: 378#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), Black: 972#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= ~N~0 thread1Thread1of1ForFork1_~i~0)), 669#true, Black: 377#(<= ~N~0 1), Black: 956#(and (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2)), Black: 419#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 970#(and (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ (* ~N~0 4) ~A~0.offset) (select |#length| ~A~0.base)) (<= ~N~0 2) (<= 4 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 2439#true, Black: 958#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))), 8#L94-4true, 3516#(and (<= thread3Thread1of1ForFork0_~i~2 ~M~0) (<= 2 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 2123#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 5#L58-7true, 536#(and (<= 0 ~M~0) (<= ~M~0 1073741822) (= ~A~0.offset 0) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) 8) (select |#length| ~A~0.base)) (<= thread2Thread1of1ForFork2_~i~1 1073741821) (<= 0 thread2Thread1of1ForFork2_~i~1) (<= (+ (* ~M~0 4) 4) (select |#length| ~A~0.base))), Black: 2404#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~A~0.offset 0) (and (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2388#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= ~M~0 0)), Black: 2416#(and (or (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (+ ~max2~0 1))) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (= ~max2~0 ~max1~0) (or (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ ~max2~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= (select |#valid| ~A~0.base) 1)) (< (select |#length| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))), Black: 2222#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2400#(and (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))))), Black: 2390#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 2396#(and (or (< 0 ~M~0) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), Black: 1142#(and (<= (+ ~M~0 1) ~N~0) (<= ~N~0 1073741823) (<= 0 ~M~0) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread3Thread1of1ForFork0_~i~2)), Black: 2206#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 371#(and (<= 0 ~M~0) (<= (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4) (select |#length| ~A~0.base)) (<= (+ ~A~0.offset (* ~M~0 4) 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 thread3Thread1of1ForFork0_~i~2)), Black: 2394#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= thread2Thread1of1ForFork2_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (= ~M~0 0)), 216#(and (<= (+ ~A~0.offset 4) (select |#length| ~A~0.base)) (<= 0 ~A~0.offset) (<= 0 (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (<= (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~A~0.base))), Black: 2337#(and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)))) (or (< ~A~0.offset 0) (and (or (< (+ ~A~0.offset (* ~M~0 4)) 0) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 2398#(and (or (< (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (+ ~max2~0 1)) (< ~M~0 0)) (= ~A~0.offset 0) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (or (= ~max2~0 0) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= (select |#valid| ~A~0.base) 1) (<= 4 (select |#length| ~A~0.base))) (= ~max2~0 0)))]) [2024-11-08 19:26:01,162 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,162 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,162 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-08 19:26:01,162 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event