./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version ffaa4be6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-ffaa4be-m [2024-10-29 13:58:12,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 13:58:12,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-29 13:58:12,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 13:58:12,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 13:58:12,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 13:58:12,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 13:58:12,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 13:58:12,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 13:58:12,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 13:58:12,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 13:58:12,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 13:58:12,934 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 13:58:12,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 13:58:12,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 13:58:12,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 13:58:12,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 13:58:12,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 13:58:12,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 13:58:12,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 13:58:12,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 13:58:12,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 13:58:12,939 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 13:58:12,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 13:58:12,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 13:58:12,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 13:58:12,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 13:58:12,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 13:58:12,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 13:58:12,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 13:58:12,942 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-29 13:58:12,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 13:58:12,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-29 13:58:12,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 13:58:12,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 13:58:12,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 13:58:12,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 13:58:12,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 13:58:12,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 13:58:12,944 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-29 13:58:12,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-29 13:58:12,945 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-29 13:58:12,945 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-29 13:58:12,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux 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 ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2024-10-29 13:58:13,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 13:58:13,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 13:58:13,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 13:58:13,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 13:58:13,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 13:58:13,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2024-10-29 13:58:14,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 13:58:14,761 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 13:58:14,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2024-10-29 13:58:14,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/74bb906b8/549e9341d398429889331ae9042c4485/FLAGa9c479c3e [2024-10-29 13:58:15,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/74bb906b8/549e9341d398429889331ae9042c4485 [2024-10-29 13:58:15,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 13:58:15,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-29 13:58:15,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 13:58:15,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 13:58:15,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 13:58:15,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4225e2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15, skipping insertion in model container [2024-10-29 13:58:15,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 13:58:15,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 13:58:15,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 13:58:15,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 13:58:15,743 INFO L204 MainTranslator]: Completed translation [2024-10-29 13:58:15,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15 WrapperNode [2024-10-29 13:58:15,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 13:58:15,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 13:58:15,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 13:58:15,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 13:58:15,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,818 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 244 [2024-10-29 13:58:15,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 13:58:15,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 13:58:15,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 13:58:15,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 13:58:15,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 13:58:15,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 13:58:15,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 13:58:15,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 13:58:15,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (1/1) ... [2024-10-29 13:58:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-29 13:58:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-29 13:58:15,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-29 13:58:15,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-29 13:58:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-29 13:58:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-29 13:58:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 13:58:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 13:58:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-29 13:58:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 13:58:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 13:58:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 13:58:15,975 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 13:58:16,103 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 13:58:16,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 13:58:16,524 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 13:58:16,524 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 13:58:16,565 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 13:58:16,565 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-29 13:58:16,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 01:58:16 BoogieIcfgContainer [2024-10-29 13:58:16,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 13:58:16,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 13:58:16,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 13:58:16,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 13:58:16,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 01:58:15" (1/3) ... [2024-10-29 13:58:16,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6424a40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 01:58:16, skipping insertion in model container [2024-10-29 13:58:16,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:58:15" (2/3) ... [2024-10-29 13:58:16,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6424a40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 01:58:16, skipping insertion in model container [2024-10-29 13:58:16,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 01:58:16" (3/3) ... [2024-10-29 13:58:16,575 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2024-10-29 13:58:16,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 13:58:16,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-29 13:58:16,591 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 13:58:16,662 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 13:58:16,715 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:58:16,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-29 13:58:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-29 13:58:16,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-29 13:58:16,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-29 13:58:16,742 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:58:16,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-29 13:58:16,760 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7c71b1bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:58:16,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-29 13:58:17,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:17,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 755334796, now seen corresponding path program 1 times [2024-10-29 13:58:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445894203] [2024-10-29 13:58:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:18,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445894203] [2024-10-29 13:58:18,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445894203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:18,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:18,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18255538] [2024-10-29 13:58:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:18,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:18,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:18,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:18,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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-10-29 13:58:18,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:18,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 13:58:18,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1921247633, now seen corresponding path program 1 times [2024-10-29 13:58:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797943194] [2024-10-29 13:58:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797943194] [2024-10-29 13:58:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797943194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940200404] [2024-10-29 13:58:18,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:18,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:18,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:18,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 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-10-29 13:58:18,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:18,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 13:58:19,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1574996066, now seen corresponding path program 1 times [2024-10-29 13:58:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:19,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448277279] [2024-10-29 13:58:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448277279] [2024-10-29 13:58:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448277279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:19,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060087882] [2024-10-29 13:58:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:19,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:19,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:19,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-29 13:58:19,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:19,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 13:58:19,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:19,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash -385903363, now seen corresponding path program 1 times [2024-10-29 13:58:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:19,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146402927] [2024-10-29 13:58:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:20,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:20,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146402927] [2024-10-29 13:58:20,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146402927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:20,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:20,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:20,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059039519] [2024-10-29 13:58:20,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:20,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:20,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:20,336 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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-10-29 13:58:20,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 13:58:20,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1407577273, now seen corresponding path program 1 times [2024-10-29 13:58:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743687624] [2024-10-29 13:58:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743687624] [2024-10-29 13:58:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743687624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:20,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:20,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576575433] [2024-10-29 13:58:20,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:20,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:20,972 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:20,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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-10-29 13:58:20,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:20,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 13:58:21,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:21,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 543527113, now seen corresponding path program 1 times [2024-10-29 13:58:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871666257] [2024-10-29 13:58:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871666257] [2024-10-29 13:58:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871666257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:21,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669204514] [2024-10-29 13:58:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:21,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:21,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:21,630 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:21,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 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-10-29 13:58:21,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 13:58:21,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1994971982, now seen corresponding path program 1 times [2024-10-29 13:58:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036840695] [2024-10-29 13:58:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036840695] [2024-10-29 13:58:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036840695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:58:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967092304] [2024-10-29 13:58:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:58:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:58:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:58:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:22,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-10-29 13:58:22,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:22,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 13:58:22,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:22,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1776316, now seen corresponding path program 1 times [2024-10-29 13:58:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:22,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566815239] [2024-10-29 13:58:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566815239] [2024-10-29 13:58:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566815239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-29 13:58:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947904999] [2024-10-29 13:58:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-29 13:58:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-29 13:58:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-29 13:58:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:23,289 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 12.75) internal successors, (153), 13 states have internal predecessors, (153), 0 states have call successors, (0), 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-10-29 13:58:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:23,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:24,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 13:58:24,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:24,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1041578466, now seen corresponding path program 1 times [2024-10-29 13:58:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498090506] [2024-10-29 13:58:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498090506] [2024-10-29 13:58:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498090506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:26,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:26,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-29 13:58:26,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256957208] [2024-10-29 13:58:26,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-29 13:58:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:26,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-29 13:58:26,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-10-29 13:58:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:26,365 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:26,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.263157894736842) internal successors, (176), 20 states have internal predecessors, (176), 0 states have call successors, (0), 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-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:26,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-29 13:58:27,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 13:58:27,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:27,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:27,536 INFO L85 PathProgramCache]: Analyzing trace with hash 350453641, now seen corresponding path program 1 times [2024-10-29 13:58:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:27,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464138578] [2024-10-29 13:58:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:27,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:28,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464138578] [2024-10-29 13:58:28,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464138578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:28,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:28,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-29 13:58:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821235454] [2024-10-29 13:58:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:28,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-29 13:58:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-29 13:58:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-10-29 13:58:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:28,996 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:28,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 9.15) internal successors, (183), 21 states have internal predecessors, (183), 0 states have call successors, (0), 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-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:28,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:28,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-29 13:58:28,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-29 13:58:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-29 13:58:30,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 13:58:30,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:30,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:30,913 INFO L85 PathProgramCache]: Analyzing trace with hash -564844698, now seen corresponding path program 1 times [2024-10-29 13:58:30,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:30,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885915729] [2024-10-29 13:58:30,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:33,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:33,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885915729] [2024-10-29 13:58:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885915729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:58:33,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:58:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-29 13:58:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902870053] [2024-10-29 13:58:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:58:33,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-29 13:58:33,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:58:33,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-29 13:58:33,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2024-10-29 13:58:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:33,155 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:58:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 9.26086956521739) internal successors, (213), 24 states have internal predecessors, (213), 0 states have call successors, (0), 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-10-29 13:58:33,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-29 13:58:33,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-29 13:58:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-29 13:58:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-29 13:58:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 13:58:35,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 13:58:35,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:58:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -724565701, now seen corresponding path program 1 times [2024-10-29 13:58:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:58:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864234106] [2024-10-29 13:58:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:58:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:58:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864234106] [2024-10-29 13:58:42,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864234106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 13:58:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883694551] [2024-10-29 13:58:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:58:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 13:58:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-29 13:58:42,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 13:58:42,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-29 13:58:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:58:42,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-10-29 13:58:42,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 13:58:42,790 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-29 13:58:42,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-29 13:58:43,191 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-29 13:58:43,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-10-29 13:58:44,318 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-10-29 13:58:44,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-29 13:58:44,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-29 13:58:44,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-29 13:58:44,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-29 13:58:44,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-29 13:58:45,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-29 13:58:45,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-29 13:58:45,337 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-29 13:58:45,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-29 13:58:45,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:45,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-29 13:58:45,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:45,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-29 13:58:45,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:45,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:45,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:45,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:45,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:45,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-29 13:58:45,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:45,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-29 13:58:46,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:46,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-10-29 13:58:46,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-29 13:58:46,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-10-29 13:58:47,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-10-29 13:58:47,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:47,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:48,216 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:48,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:48,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:48,344 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:48,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:48,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:48,456 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:48,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:48,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:48,568 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:48,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:48,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:48,835 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:48,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:48,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:48,936 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:48,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:48,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:49,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:49,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:49,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:49,163 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-29 13:58:49,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-29 13:58:49,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-29 13:58:49,330 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-10-29 13:58:49,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 41 [2024-10-29 13:58:49,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2024-10-29 13:58:49,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:49,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:49,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:49,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-29 13:58:49,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:49,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:49,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:49,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-29 13:58:49,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2024-10-29 13:58:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 13:58:49,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-29 13:58:52,254 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int)) (or (forall ((v_ArrVal_2071 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse0 |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| |c_ULTIMATE.start_main_#t~mem56#1.offset|))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| |c_ULTIMATE.start_main_#t~mem56#1.offset|) (forall ((v_ArrVal_2071 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse1 |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int)) (or (forall ((v_ArrVal_2071 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse2 |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| |c_ULTIMATE.start_main_#t~mem56#1.offset|))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int)) (or (forall ((v_ArrVal_2071 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse3 |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| |c_ULTIMATE.start_main_#t~mem56#1.offset|)))) is different from false [2024-10-29 13:58:52,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~1#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse0))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse0))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse0)))))) is different from false [2024-10-29 13:58:52,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse6))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse3 .cse1 (store (select .cse3 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2))) (forall ((v_ArrVal_2069 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2)))))) is different from false [2024-10-29 13:58:52,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse6))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse3 .cse1 (store (select .cse3 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2069))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse2)))))) is different from false [2024-10-29 13:58:53,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse7))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse0 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3) (= (select (select (let ((.cse6 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) is different from false [2024-10-29 13:58:53,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse7))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3) (= (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) is different from false [2024-10-29 13:58:53,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse2 (select (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse8 (+ (select (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse3 (select (select .cse9 .cse2) .cse8)) (.cse1 (select (select .cse7 .cse2) .cse8))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))))))))) is different from false [2024-10-29 13:58:53,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse2 (select (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse8 (+ (select (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse1 (select (select .cse9 .cse2) .cse8)) (.cse3 (select (select .cse7 .cse2) .cse8))) (and (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse0 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse4 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse5 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))) (forall ((v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (or (= (select (select (let ((.cse6 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse2 v_ArrVal_2069))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| .cse3))))))) is different from false [2024-10-29 13:58:53,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|))) (and (forall ((v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 |c_ULTIMATE.start_insert_#t~mem32#1.offset|) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse9 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 v_ArrVal_2038)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse2 (+ (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse1 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse0 .cse1) .cse2)) (= (select (select (let ((.cse3 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse1 v_ArrVal_2069)) (.cse4 (select (select .cse5 .cse1) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))))) (forall ((v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 |c_ULTIMATE.start_insert_#t~mem32#1.offset|) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse18 v_ArrVal_2038)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse13 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse17 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse14 (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse15 (+ (select (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse11 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse14 v_ArrVal_2069)) (.cse12 (select (select .cse13 .cse14) .cse15))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse16 .cse14) .cse15))))))))) (forall ((v_ArrVal_2038 Int)) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse20 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse27 v_ArrVal_2038)))) (store .cse26 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse22 (+ (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse21 (select (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse20 .cse21) .cse22)) (= (select (select (let ((.cse23 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse21 v_ArrVal_2069)) (.cse24 (select (select .cse25 .cse21) .cse22))) (store .cse23 .cse24 (store (select .cse23 .cse24) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) (< v_ArrVal_2038 |c_ULTIMATE.start_insert_#t~mem32#1.offset|))) (forall ((v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 |c_ULTIMATE.start_insert_#t~mem32#1.offset|) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse36 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse34 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse36 v_ArrVal_2038)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse31 (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse35 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse32 (select (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse33 (+ (select (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse29 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse32 v_ArrVal_2069)) (.cse30 (select (select .cse31 .cse32) .cse33))) (store .cse29 .cse30 (store (select .cse29 .cse30) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse34 .cse32) .cse33))))))))))) is different from false [2024-10-29 13:58:54,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset|))) (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse9 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse6 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse9 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse9 v_ArrVal_2038)))) (store .cse7 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse2 (+ (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse1 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse0 .cse1) .cse2)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse4 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse1 v_ArrVal_2069)) (.cse5 (select (select .cse6 .cse1) .cse2))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse13 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse20 v_ArrVal_2038)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse15 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse14 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse13 .cse14) .cse15)) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse16 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse14 v_ArrVal_2069)) (.cse17 (select (select .cse18 .cse14) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< v_ArrVal_2038 .cse3)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse22 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse29 v_ArrVal_2038)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse24 (+ (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse23 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse22 .cse23) .cse24)) (= (select (select (let ((.cse25 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse23 v_ArrVal_2069)) (.cse26 (select (select .cse27 .cse23) .cse24))) (store .cse25 .cse26 (store (select .cse25 .cse26) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse3)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse31 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse38 v_ArrVal_2038)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse33 (+ (select (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse32 (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse31 .cse32) .cse33)) (= (select (select (let ((.cse34 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse32 v_ArrVal_2069)) (.cse35 (select (select .cse36 .cse32) .cse33))) (store .cse34 .cse35 (store (select .cse34 .cse35) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse3)))))))) is different from false [2024-10-29 13:58:54,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|))) (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse9 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse12 .cse9 v_ArrVal_2038)))) (store .cse11 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse11 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse9 .cse10)))) (store .cse7 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse7 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse3 (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse4 (+ (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse0 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse3 v_ArrVal_2069)) (.cse1 (select (select .cse2 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse5) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse6 .cse3) .cse4))))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse12 .cse20 v_ArrVal_2038)))) (store .cse21 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse20 .cse10)))) (store .cse19 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse16 (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse17 (+ (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse13 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse16 v_ArrVal_2069)) (.cse14 (select (select .cse15 .cse16) .cse17))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse5) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse18 .cse16) .cse17))))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse29 .cse10)))) (store .cse30 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse22 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse12 .cse29 v_ArrVal_2038)))) (store .cse28 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse24 (+ (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse23 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< v_ArrVal_2038 .cse5) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse22 .cse23) .cse24)) (= (select (select (let ((.cse25 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse23 v_ArrVal_2069)) (.cse26 (select (select .cse27 .cse23) .cse24))) (store .cse25 .cse26 (store (select .cse25 .cse26) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse12 .cse38 v_ArrVal_2038)))) (store .cse39 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse8 .cse38 .cse10)))) (store .cse37 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse34 (select (select .cse33 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse35 (+ (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse31 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse34 v_ArrVal_2069)) (.cse32 (select (select .cse33 .cse34) .cse35))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse5) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse36 .cse34) .cse35))))))))) is different from false [2024-10-29 13:58:56,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|))) (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse9 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse6 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse9 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse8 .cse9 v_ArrVal_2038)))) (store .cse7 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse7 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse2 (+ (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse1 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse0 .cse1) .cse2)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse4 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse1 v_ArrVal_2069)) (.cse5 (select (select .cse6 .cse1) .cse2))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse13 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse8 .cse20 v_ArrVal_2038)))) (store .cse19 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse15 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse14 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse13 .cse14) .cse15)) (= (select (select (let ((.cse16 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse14 v_ArrVal_2069)) (.cse17 (select (select .cse18 .cse14) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse3)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse22 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse8 .cse29 v_ArrVal_2038)))) (store .cse28 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse24 (+ (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse23 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse22 .cse23) .cse24)) (= (select (select (let ((.cse25 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse23 v_ArrVal_2069)) (.cse26 (select (select .cse27 .cse23) .cse24))) (store .cse25 .cse26 (store (select .cse25 .cse26) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse3)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse31 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse8 .cse38 v_ArrVal_2038)))) (store .cse37 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse33 (+ (select (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse32 (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select .cse31 .cse32) .cse33)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse34 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2045) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2053) |c_~#A~0.base| v_ArrVal_2057) .cse32 v_ArrVal_2069)) (.cse35 (select (select .cse36 .cse32) .cse33))) (store .cse34 .cse35 (store (select .cse34 .cse35) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))))) is different from false [2024-10-29 13:58:56,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|))) (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse2 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse2 v_ArrVal_2038)))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse2 .cse8)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse10 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse10 v_ArrVal_2038)))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse10)) (= (select (select (let ((.cse11 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse10 .cse8)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse10))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 .cse3)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse15 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse15 v_ArrVal_2038)))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse15)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse16 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse15 .cse8)))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse20 v_ArrVal_2038)))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse20)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse21 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse20 .cse8)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse20))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))))) is different from false [2024-10-29 13:58:57,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|))) (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse2 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse2 v_ArrVal_2038)))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse2 .cse8)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse10 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse10 v_ArrVal_2038)))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse10)) (< v_ArrVal_2038 .cse3) (= (select (select (let ((.cse11 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse10 .cse8)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse10))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse15 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse15 v_ArrVal_2038)))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse15)) (< v_ArrVal_2038 .cse3) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse16 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse15 .cse8)))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse22 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse19 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse22 .cse8)))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse22))) (store .cse19 .cse20 (store (select .cse19 .cse20) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse1 .cse22 v_ArrVal_2038)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse22)) (< v_ArrVal_2038 .cse3)))))) is different from false [2024-10-29 13:58:57,736 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2028)) (.cse2 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~p~1#1.base|) .cse2 v_ArrVal_2038)))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2)) (< v_ArrVal_2038 (select (select .cse1 |c_~#A~0.base|) |c_~#A~0.offset|)) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse4 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2029))) (store .cse6 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~p~1#1.base|) .cse2 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4)) (.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2028))) (or (= (select (select (let ((.cse7 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse8 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2029))) (store .cse10 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 v_ArrVal_2038)))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11)) (< v_ArrVal_2038 (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4)) (.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2028))) (or (= (select (select (let ((.cse14 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse15 (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2029))) (store .cse17 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 v_ArrVal_2038)))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18)) (< v_ArrVal_2038 (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse25 (+ |ULTIMATE.start_insert_~p#1.offset| 4)) (.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2028))) (or (= (select (select (let ((.cse21 (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse22 (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2029))) (store .cse24 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 v_ArrVal_2038)))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25)) (< v_ArrVal_2038 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|)))))) is different from false [2024-10-29 13:58:58,564 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2028)) (.cse5 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< v_ArrVal_2038 (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|)) (= |c_t_funThread1of1ForFork0_#t~nondet41#1| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse2 (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2029))) (store .cse4 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~p~1#1.base|) .cse5 (select (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse5))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse6 (store .cse0 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~p~1#1.base|) .cse5 v_ArrVal_2038)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse5))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2028)) (.cse12 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< v_ArrVal_2038 (select (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset|)) (= (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse9 (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2029))) (store .cse11 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~p~1#1.base|) .cse12 (select (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse10 |c_~#A~0.base| (store (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))) (store .cse8 .cse9 (store (select .cse8 .cse9) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse13 (store .cse7 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~p~1#1.base|) .cse12 v_ArrVal_2038)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2028)) (.cse19 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< v_ArrVal_2038 (select (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset|)) (= (select (select (let ((.cse15 (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse16 (select (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2029))) (store .cse18 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~p~1#1.base|) .cse19 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse17 |c_~#A~0.base| (store (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse19))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse20 (store .cse14 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~p~1#1.base|) .cse19 v_ArrVal_2038)))) (store .cse20 |c_~#A~0.base| (store (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse19))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2028)) (.cse26 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< v_ArrVal_2038 (select (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset|)) (= (select (select (let ((.cse22 (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2033) |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse23 (select (select (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2029))) (store .cse25 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~p~1#1.base|) .cse26 (select (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse24 |c_~#A~0.base| (store (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse26))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse27 (store .cse21 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~p~1#1.base|) .cse26 v_ArrVal_2038)))) (store .cse27 |c_~#A~0.base| (store (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse26)))))) is different from false [2024-10-29 13:58:58,798 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse3 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2029 .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2028 .cse3 v_ArrVal_2038)))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse3)) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2029 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse7 |c_~#A~0.base| (store (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse8))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2028 .cse8 v_ArrVal_2038)))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse8)) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse13 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse10 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2029 .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse13))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2028 .cse13 v_ArrVal_2038)))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse13)) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse15 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2069)) (.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2029 .cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse17 |c_~#A~0.base| (store (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2028 .cse18 v_ArrVal_2038)))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18)) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)))))) is different from false [2024-10-29 13:58:59,066 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse1 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2028 .cse1 v_ArrVal_2038)))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse1)) (= (select (select (let ((.cse2 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2069)) (.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2029 .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2069)) (.cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2029 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse7 |c_~#A~0.base| (store (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse8))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2028 .cse8 v_ArrVal_2038)))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse8)) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2028 .cse11 v_ArrVal_2038)))) (store .cse10 |c_~#A~0.base| (store (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse11)) (= (select (select (let ((.cse12 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2069)) (.cse13 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2029 .cse11 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse11))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2069 (Array Int Int)) (v_ArrVal_2038 Int) (v_ArrVal_2057 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_30| Int) (v_ArrVal_2071 Int)) (let ((.cse16 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_30| (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2028 .cse16 v_ArrVal_2038)))) (store .cse15 |c_~#A~0.base| (store (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse16)) (= (select (select (let ((.cse17 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2057) |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2069)) (.cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| (store v_ArrVal_2029 .cse16 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base|))) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse16))) (store .cse17 .cse18 (store (select .cse17 .cse18) (+ |v_ULTIMATE.start_main_~p~1#1.offset_30| 4) v_ArrVal_2071))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet41#1|) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)))))) is different from false [2024-10-29 14:00:37,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:37,816 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 158 [2024-10-29 14:00:37,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8472 treesize of output 7488 [2024-10-29 14:00:37,880 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 1558 treesize of output 1526 [2024-10-29 14:00:37,902 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 1638 treesize of output 1574 [2024-10-29 14:00:39,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:39,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 413 treesize of output 387 [2024-10-29 14:00:39,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:39,360 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 156 [2024-10-29 14:00:39,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:39,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6088 treesize of output 5168 [2024-10-29 14:00:39,421 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 1238 treesize of output 1222 [2024-10-29 14:00:39,443 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 1334 treesize of output 1302 [2024-10-29 14:00:40,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:40,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 282 [2024-10-29 14:00:40,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:40,725 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 158 [2024-10-29 14:00:40,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:40,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12252 treesize of output 10372 [2024-10-29 14:00:40,798 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 1358 treesize of output 1326 [2024-10-29 14:00:40,822 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 1454 treesize of output 1390 [2024-10-29 14:00:41,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:41,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 355 [2024-10-29 14:00:42,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:42,069 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 158 [2024-10-29 14:00:42,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:42,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3208 treesize of output 2980 [2024-10-29 14:00:42,122 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 1862 treesize of output 1798 [2024-10-29 14:00:42,147 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 1861 treesize of output 1829 [2024-10-29 14:00:43,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:00:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 574 treesize of output 548 [2024-10-29 14:00:43,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse44 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_3 (Array Int Int))) (= (let ((.cse76 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_3 .cse76 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_3) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse75 |c_~#A~0.base| (store (select .cse75 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse76)) |c_t_funThread1of1ForFork0_~p~0#1.base|))) (.cse3 (= |c_t_funThread1of1ForFork0_~p~0#1.base| 0)) (.cse4 (not (= (select |c_#valid| |c_t_funThread1of1ForFork0_~p~0#1.base|) 0))) (.cse10 (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| |c_~#A~0.base|)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_17 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_17) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (let ((.cse1 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_17 .cse1 .cse2)))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse1))) (not (= |c_~#A~0.base| .cse2)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or (forall ((v_ArrVal_2029 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|))) .cse3 .cse4) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_11 (Array Int Int))) (let ((.cse5 (let ((.cse7 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_11 .cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_11) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse7)))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse5)) (not (= .cse5 |c_~#A~0.base|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse3 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_13 (Array Int Int))) (not (= (let ((.cse9 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_13 .cse9 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_13) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse8 |c_~#A~0.base| (store (select .cse8 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9)) |c_~#A~0.base|))) .cse4) (or .cse10 (forall ((v_ArrVal_2029 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (let ((.cse13 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_4 .cse13 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_4) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse13)))) (or (not (= .cse11 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse11))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_5) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse14)) (not (= |c_~#A~0.base| .cse14))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_18 (Array Int Int))) (let ((.cse15 (let ((.cse17 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_18 .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_18) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse17)))) (or (not (= .cse15 |c_t_funThread1of1ForFork0_~p~0#1.base|)) (not (= .cse15 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse3 .cse4 (forall ((v_prenex_10 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_10) |c_~#A~0.base|) |c_~#A~0.offset|)))) (or .cse10 (and (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_24 (Array Int Int))) (= (let ((.cse19 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_24 .cse19 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_24) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse19)) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_29 (Array Int Int))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_29) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse20) (= (let ((.cse22 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_29 .cse22 .cse20)))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse22)) |c_~#A~0.base|)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_27 (Array Int Int))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_27) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse24 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_27 .cse24 .cse25)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse24)) |c_t_funThread1of1ForFork0_~p~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse25)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_26 (Array Int Int))) (let ((.cse28 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_26) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_26 .cse27 .cse28)))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse27)) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse30 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_25 .cse30 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_25) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse29 |c_~#A~0.base| (store (select .cse29 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse30)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_28 (Array Int Int))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_28) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse32 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_28 .cse32 .cse33)))) (store .cse31 |c_~#A~0.base| (store (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse32))) (not (= .cse33 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))))) (or .cse10 (forall ((v_prenex_10 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_10) |c_~#A~0.base|) |c_~#A~0.offset|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)) (forall ((v_prenex_30 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse35 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= (select (select (let ((.cse34 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_30 .cse35 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_30) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse34 |c_~#A~0.base| (store (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse35) |c_t_funThread1of1ForFork0_~p~0#1.base|)) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ 3 (select (select (let ((.cse36 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse35 v_ArrVal_2038)))) (store .cse36 |c_~#A~0.base| (store (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse35)))))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse3 (forall ((v_prenex_19 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_19) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_~#A~0.base| .cse37)) (= (let ((.cse39 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_19 .cse39 .cse37)))) (store .cse38 |c_~#A~0.base| (store (select .cse38 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse39)) |c_t_funThread1of1ForFork0_~p~0#1.base|)))) .cse4) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse40 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse42 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse40)) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ 4 (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse42 v_ArrVal_2038)))) (store .cse41 |c_~#A~0.base| (store (select .cse41 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse42))) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse42 .cse40)))) (store .cse43 |c_~#A~0.base| (store (select .cse43 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse42)))))) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or (and (or .cse3 .cse4 .cse44) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_1 (Array Int Int))) (= (let ((.cse46 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_1 .cse46 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_1) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse45 |c_~#A~0.base| (store (select .cse45 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse46)) |c_t_funThread1of1ForFork0_~p~0#1.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) .cse10) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_31 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse47 (let ((.cse49 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_31 .cse49 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_31) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse48 |c_~#A~0.base| (store (select .cse48 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse49)))) (or (not (= .cse47 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse47))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_12) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse50)) (not (= .cse50 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))))) (or .cse3 .cse4 (forall ((v_prenex_16 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_16) |c_~#A~0.base|) |c_~#A~0.offset|)))) (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int) (v_prenex_16 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_16) |c_~#A~0.base|) |c_~#A~0.offset|) |c_t_funThread1of1ForFork0_~p~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)) (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse51 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse53 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse51)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse52 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse53 .cse51)))) (store .cse52 |c_~#A~0.base| (store (select .cse52 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse53))) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ 2 (select (select (let ((.cse54 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse53 v_ArrVal_2038)))) (store .cse54 |c_~#A~0.base| (store (select .cse54 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse53)))))))))) (or (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_1 (Array Int Int))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_1) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_~#A~0.base| .cse55) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse57 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_1 .cse57 .cse55)))) (store .cse56 |c_~#A~0.base| (store (select .cse56 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse57)))))) .cse44) .cse3 .cse4) (or .cse10 (forall ((v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_20) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (or (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (let ((.cse59 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse58 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse59 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse58 |c_~#A~0.base| (store (select .cse58 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse59)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) .cse10) (or .cse3 .cse4 (and (or .cse10 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_24 (Array Int Int))) (= (let ((.cse61 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_24 .cse61 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_24) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse60 |c_~#A~0.base| (store (select .cse60 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse61)) |c_~#A~0.base|))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_29 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_29) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse63 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_29 .cse63 .cse64)))) (store .cse62 |c_~#A~0.base| (store (select .cse62 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse63)) |c_~#A~0.base|) (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse64)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_26 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse66 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_26 .cse66 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_26) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse65 |c_~#A~0.base| (store (select .cse65 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse66)))) (or (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse68 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_25 .cse68 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_25) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse67 |c_~#A~0.base| (store (select .cse67 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse68)))) .cse10) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_27 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse70 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_27 .cse70 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_27) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse69 |c_~#A~0.base| (store (select .cse69 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse70)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_2 (Array Int Int))) (let ((.cse73 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_2) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse72 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_2 .cse72 .cse73)))) (store .cse71 |c_~#A~0.base| (store (select .cse71 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse72))) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse73)) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ (select (select (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse72 v_ArrVal_2038)))) (store .cse74 |c_~#A~0.base| (store (select .cse74 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse72) 1))))) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))))) is different from false [2024-10-29 14:00:45,443 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse44 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_3 (Array Int Int))) (= (let ((.cse76 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_3 .cse76 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_3) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse75 |c_~#A~0.base| (store (select .cse75 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse76)) |c_t_funThread1of1ForFork0_~p~0#1.base|))) (.cse3 (= |c_t_funThread1of1ForFork0_~p~0#1.base| 0)) (.cse4 (not (= (select |c_#valid| |c_t_funThread1of1ForFork0_~p~0#1.base|) 0))) (.cse10 (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| |c_~#A~0.base|)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_17 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_17) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (let ((.cse1 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_17 .cse1 .cse2)))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse1))) (not (= |c_~#A~0.base| .cse2)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or (forall ((v_ArrVal_2029 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|))) .cse3 .cse4) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_11 (Array Int Int))) (let ((.cse5 (let ((.cse7 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_11 .cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_11) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse7)))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse5)) (not (= .cse5 |c_~#A~0.base|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse3 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_13 (Array Int Int))) (not (= (let ((.cse9 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_13 .cse9 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_13) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse8 |c_~#A~0.base| (store (select .cse8 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9)) |c_~#A~0.base|))) .cse4) (or .cse10 (forall ((v_ArrVal_2029 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_4 (Array Int Int))) (let ((.cse11 (let ((.cse13 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_4 .cse13 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_4) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse13)))) (or (not (= .cse11 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse11))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_5) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse14)) (not (= |c_~#A~0.base| .cse14))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_18 (Array Int Int))) (let ((.cse15 (let ((.cse17 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_18 .cse17 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_18) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse17)))) (or (not (= .cse15 |c_t_funThread1of1ForFork0_~p~0#1.base|)) (not (= .cse15 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse3 .cse4 (forall ((v_prenex_10 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_10) |c_~#A~0.base|) |c_~#A~0.offset|)))) (or .cse10 (and (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_24 (Array Int Int))) (= (let ((.cse19 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_24 .cse19 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_24) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse19)) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_29 (Array Int Int))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_29) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse20) (= (let ((.cse22 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_29 .cse22 .cse20)))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse22)) |c_~#A~0.base|)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_27 (Array Int Int))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_27) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse24 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_27 .cse24 .cse25)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse24)) |c_t_funThread1of1ForFork0_~p~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse25)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_26 (Array Int Int))) (let ((.cse28 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_26) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_26 .cse27 .cse28)))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse27)) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse30 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_25 .cse30 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_25) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse29 |c_~#A~0.base| (store (select .cse29 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse30)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_28 (Array Int Int))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_28) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse32 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_28 .cse32 .cse33)))) (store .cse31 |c_~#A~0.base| (store (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse32))) (not (= .cse33 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))))) (or .cse10 (forall ((v_prenex_10 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_10) |c_~#A~0.base|) |c_~#A~0.offset|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)) (forall ((v_prenex_30 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse35 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= (select (select (let ((.cse34 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_30 .cse35 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_30) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse34 |c_~#A~0.base| (store (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse35) |c_t_funThread1of1ForFork0_~p~0#1.base|)) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ 3 (select (select (let ((.cse36 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse35 v_ArrVal_2038)))) (store .cse36 |c_~#A~0.base| (store (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse35)))))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse3 (forall ((v_prenex_19 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_19) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_~#A~0.base| .cse37)) (= (let ((.cse39 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_19 .cse39 .cse37)))) (store .cse38 |c_~#A~0.base| (store (select .cse38 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse39)) |c_t_funThread1of1ForFork0_~p~0#1.base|)))) .cse4) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse40 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse42 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse40)) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ 4 (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse42 v_ArrVal_2038)))) (store .cse41 |c_~#A~0.base| (store (select .cse41 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse42))) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse42 .cse40)))) (store .cse43 |c_~#A~0.base| (store (select .cse43 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse42)))))) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or (and (or .cse3 .cse4 .cse44) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_1 (Array Int Int))) (= (let ((.cse46 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_1 .cse46 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_1) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse45 |c_~#A~0.base| (store (select .cse45 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse46)) |c_t_funThread1of1ForFork0_~p~0#1.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) .cse10) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_31 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse47 (let ((.cse49 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_31 .cse49 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_31) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse48 |c_~#A~0.base| (store (select .cse48 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse49)))) (or (not (= .cse47 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse47))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_12) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse50)) (not (= .cse50 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))))) (or .cse3 .cse4 (forall ((v_prenex_16 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_16) |c_~#A~0.base|) |c_~#A~0.offset|)))) (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int) (v_prenex_16 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_16) |c_~#A~0.base|) |c_~#A~0.offset|) |c_t_funThread1of1ForFork0_~p~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)) (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse51 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse53 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse51)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse52 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse53 .cse51)))) (store .cse52 |c_~#A~0.base| (store (select .cse52 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse53))) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ 2 (select (select (let ((.cse54 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse53 v_ArrVal_2038)))) (store .cse54 |c_~#A~0.base| (store (select .cse54 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse53)))))))))) (or (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_1 (Array Int Int))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_1) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_~#A~0.base| .cse55) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse57 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_1 .cse57 .cse55)))) (store .cse56 |c_~#A~0.base| (store (select .cse56 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse57)))))) .cse44) .cse3 .cse4) (or .cse10 (forall ((v_prenex_20 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_20) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (or (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (let ((.cse59 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse58 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse59 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse58 |c_~#A~0.base| (store (select .cse58 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse59)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) .cse10) (or .cse3 .cse4 (and (or .cse10 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_24 (Array Int Int))) (= (let ((.cse61 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_24 .cse61 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_24) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse60 |c_~#A~0.base| (store (select .cse60 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse61)) |c_~#A~0.base|))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_29 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_29) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse63 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_29 .cse63 .cse64)))) (store .cse62 |c_~#A~0.base| (store (select .cse62 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse63)) |c_~#A~0.base|) (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse64)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_26 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse66 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_26 .cse66 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_26) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse65 |c_~#A~0.base| (store (select .cse65 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse66)))) (or (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse68 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_25 .cse68 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_25) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse67 |c_~#A~0.base| (store (select .cse67 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse68)))) .cse10) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_27 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse70 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_27 .cse70 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_27) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse69 |c_~#A~0.base| (store (select .cse69 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse70)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_2 (Array Int Int))) (let ((.cse73 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_2) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse72 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse71 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_2 .cse72 .cse73)))) (store .cse71 |c_~#A~0.base| (store (select .cse71 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse72))) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse73)) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ (select (select (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse72 v_ArrVal_2038)))) (store .cse74 |c_~#A~0.base| (store (select .cse74 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse72) 1))))) (< v_ArrVal_2038 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))))) is different from true [2024-10-29 14:00:48,416 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse66 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_3 (Array Int Int))) (= (let ((.cse97 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse96 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_3 .cse97 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_3) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse96 |c_~#A~0.base| (store (select .cse96 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse97)) |c_t_funThread1of1ForFork0_~p~0#1.base|))) (.cse0 (= |c_t_funThread1of1ForFork0_~p~0#1.base| 0)) (.cse1 (not (= (select |c_#valid| |c_t_funThread1of1ForFork0_~p~0#1.base|) 0))) (.cse8 (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| |c_~#A~0.base|)))) (and (or (forall ((v_ArrVal_2029 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|))) .cse0 .cse1) (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2014))) (or (< v_ArrVal_2038 (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|)) (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ (select (select (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse4 v_ArrVal_2038)))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse4) 4)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse5)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse6 (store .cse7 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse4 .cse5)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse4)))))))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse8 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015) |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_20) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (or .cse8 (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015) |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|) |c_~#A~0.base|))))) (or .cse0 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_13 (Array Int Int))) (not (= (let ((.cse10 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_13 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_13) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse10)) |c_~#A~0.base|))) .cse1) (or .cse8 (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015) |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_10) |c_~#A~0.base|) |c_~#A~0.offset|))))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_11 (Array Int Int))) (let ((.cse11 (let ((.cse14 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse13 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_11 .cse14 (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_11) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse14)))) (or (not (= .cse11 |c_t_funThread1of1ForFork0_~p~0#1.base|)) (not (= .cse11 |c_~#A~0.base|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse0 .cse1 (forall ((v_prenex_10 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_10) |c_~#A~0.base|) |c_~#A~0.offset|)))) (or .cse8 (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int) (v_prenex_16 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015) |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_16) |c_~#A~0.base|) |c_~#A~0.offset|)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2014))) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_2 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse18 (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_2) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse17 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ (select (select (let ((.cse15 (store .cse16 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse17 v_ArrVal_2038)))) (store .cse15 |c_~#A~0.base| (store (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse17) 1)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse18)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse19 (store .cse20 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_2 .cse17 .cse18)))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse17))))))) (< v_ArrVal_2038 (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2014))) (or (forall ((v_ArrVal_2029 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse24 (select (select (store .cse26 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse23 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ (select (select (let ((.cse21 (store .cse22 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse23 v_ArrVal_2038)))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse23) 2)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse24)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse25 (store .cse26 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse23 .cse24)))) (store .cse25 |c_~#A~0.base| (store (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse23))))))) (< v_ArrVal_2038 (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse8 (and (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_24 (Array Int Int))) (= (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse27 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse28 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_24 .cse29 (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_24) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse27 |c_~#A~0.base| (store (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse29)) |c_~#A~0.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_29 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_29) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse30) (= (let ((.cse33 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse31 (store .cse32 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_29 .cse33 .cse30)))) (store .cse31 |c_~#A~0.base| (store (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse33)) |c_~#A~0.base|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse36 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse35 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_25 .cse36 (select (select (store .cse35 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_25) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse34 |c_~#A~0.base| (store (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse36)))))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_28 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse40 (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_28) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse39 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse37 (store .cse38 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_28 .cse39 .cse40)))) (store .cse37 |c_~#A~0.base| (store (select .cse37 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse39))) (not (= .cse40 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_27 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse44 (select (select (store .cse42 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_27) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse43 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse41 (store .cse42 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_27 .cse43 .cse44)))) (store .cse41 |c_~#A~0.base| (store (select .cse41 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse43)) |c_t_funThread1of1ForFork0_~p~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse44))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_26 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse45 (select (select (store .cse47 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_26) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse45) (= (let ((.cse48 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse46 (store .cse47 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_26 .cse48 .cse45)))) (store .cse46 |c_~#A~0.base| (store (select .cse46 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse48)) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_17 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (let ((.cse52 (select (select (store .cse50 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_17) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse51 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse49 (store .cse50 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_17 .cse51 .cse52)))) (store .cse49 |c_~#A~0.base| (store (select .cse49 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse51)) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) (not (= .cse52 |c_~#A~0.base|)) (not (= .cse52 |c_t_funThread1of1ForFork0_~p~0#1.base|)))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_4 (Array Int Int))) (let ((.cse53 (let ((.cse56 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse55 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_4 .cse56 (select (select (store .cse55 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_4) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse54 |c_~#A~0.base| (store (select .cse54 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse56)))) (or (not (= .cse53 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse53))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse0 (forall ((v_prenex_19 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse57 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_19) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_~#A~0.base| .cse57)) (= (let ((.cse59 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_19 .cse59 .cse57)))) (store .cse58 |c_~#A~0.base| (store (select .cse58 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse59)) |c_t_funThread1of1ForFork0_~p~0#1.base|)))) .cse1) (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2038 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2014))) (or (forall ((v_prenex_30 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse62 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (let ((.cse60 (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse61 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_30 .cse62 (select (select (store .cse61 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_30) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse60 |c_~#A~0.base| (store (select .cse60 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse62))) (< |c_t_funThread1of1ForFork0_~p~0#1.offset| (+ (select (select (let ((.cse63 (store .cse64 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2028 .cse62 v_ArrVal_2038)))) (store .cse63 |c_~#A~0.base| (store (select .cse63 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse62) 3))))) (< v_ArrVal_2038 (select (select (store .cse64 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2028) |c_~#A~0.base|) |c_~#A~0.offset|))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_12 (Array Int Int))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015) |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_12) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse65)) (not (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse65))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (or .cse8 (and (or .cse0 .cse1 .cse66) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse69 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse68 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_1 .cse69 (select (select (store .cse68 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_1) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse67 |c_~#A~0.base| (store (select .cse67 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse69)))))))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse70 (select (select (store (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015) |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_5) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse70)) (not (= |c_~#A~0.base| .cse70))))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((v_prenex_31 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (let ((.cse71 (let ((.cse74 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse73 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_31 .cse74 (select (select (store .cse73 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_31) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse72 |c_~#A~0.base| (store (select .cse72 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse74)))) (or (not (= .cse71 |v_ULTIMATE.start_main_#t~malloc48#1.base_7|)) (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse71))))))) (forall ((v_ArrVal_2015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_18 (Array Int Int))) (let ((.cse75 (let ((.cse78 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse76 (let ((.cse77 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse77 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_prenex_18 .cse78 (select (select (store .cse77 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_prenex_18) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse76 |c_~#A~0.base| (store (select .cse76 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse78)))) (or (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse75)) (not (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| .cse75))))))) (or .cse0 .cse1 (forall ((v_prenex_16 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_16) |c_~#A~0.base|) |c_~#A~0.offset|)))) (or (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_1 (Array Int Int))) (let ((.cse79 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_1) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= |c_~#A~0.base| .cse79) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse81 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_1 .cse81 .cse79)))) (store .cse80 |c_~#A~0.base| (store (select .cse80 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse81)))))) .cse66) .cse0 .cse1) (or .cse8 (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc48#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) 0)) (not (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (let ((.cse84 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse82 (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2015))) (store .cse83 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| (store v_ArrVal_2029 .cse84 (select (select (store .cse83 |v_ULTIMATE.start_main_#t~malloc48#1.base_7| v_ArrVal_2029) |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse82 |c_~#A~0.base| (store (select .cse82 |c_~#A~0.base|) |c_~#A~0.offset| |v_ULTIMATE.start_main_#t~malloc48#1.base_7|))) |v_ULTIMATE.start_main_#t~malloc48#1.base_7|) .cse84)))) (= |v_ULTIMATE.start_main_#t~malloc48#1.base_7| 0)))) (or .cse0 .cse1 (and (or .cse8 (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_24 (Array Int Int))) (= (let ((.cse86 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_24 .cse86 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_24) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse85 |c_~#A~0.base| (store (select .cse85 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse86)) |c_~#A~0.base|))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_29 (Array Int Int))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_29) |c_~#A~0.base|) |c_~#A~0.offset|))) (or (= (let ((.cse88 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse87 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_29 .cse88 .cse89)))) (store .cse87 |c_~#A~0.base| (store (select .cse87 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse88)) |c_~#A~0.base|) (= |c_t_funThread1of1ForFork0_~p~0#1.base| .cse89)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_26 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse91 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_26 .cse91 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_26) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse90 |c_~#A~0.base| (store (select .cse90 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse91)))) (or (forall ((v_prenex_25 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int)) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse93 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse92 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_25 .cse93 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_25) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse92 |c_~#A~0.base| (store (select .cse92 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse93)))) .cse8) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_prenex_27 (Array Int Int))) (= |c_t_funThread1of1ForFork0_~p~0#1.base| (let ((.cse95 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (select (select (let ((.cse94 (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| (store v_prenex_27 .cse95 (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_~p~0#1.base| v_prenex_27) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse94 |c_~#A~0.base| (store (select .cse94 |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of1ForFork0_~p~0#1.base|))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse95)))))))) is different from true [2024-10-29 14:01:02,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:01:02,252 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 3863 treesize of output 3776 [2024-10-29 14:01:06,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:01:06,342 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 3767 treesize of output 2600 [2024-10-29 14:01:07,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:01:07,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28951 treesize of output 28041 [2024-10-29 14:01:07,364 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 2879 treesize of output 2875 [2024-10-29 14:01:07,401 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 2880 treesize of output 2878 [2024-10-29 14:01:07,436 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 2878 treesize of output 2876 [2024-10-29 14:01:07,475 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 2881 treesize of output 2877 [2024-10-29 14:01:07,529 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 2866 treesize of output 2862 [2024-10-29 14:01:07,566 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 2867 treesize of output 2865 [2024-10-29 14:01:07,613 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 2854 treesize of output 2852 [2024-10-29 14:01:07,649 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 2853 treesize of output 2849 [2024-10-29 14:01:07,700 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 2842 treesize of output 2838 [2024-10-29 14:01:07,737 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 2843 treesize of output 2839 [2024-10-29 14:01:07,772 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 2839 treesize of output 2835 [2024-10-29 14:01:07,811 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 2835 treesize of output 2831 [2024-10-29 14:01:07,849 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 2837 treesize of output 2835 [2024-10-29 14:01:07,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:01:07,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3860 treesize of output 3842 [2024-10-29 14:01:08,023 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 3120 treesize of output 3112 [2024-10-29 14:01:08,067 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 3124 treesize of output 3120 [2024-10-29 14:01:08,129 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 3120 treesize of output 3116 [2024-10-29 14:01:08,174 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 3116 treesize of output 3108 [2024-10-29 14:01:08,220 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 3120 treesize of output 3112 [2024-10-29 14:01:08,269 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 3122 treesize of output 3118 [2024-10-29 14:01:08,317 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 3132 treesize of output 3124 [2024-10-29 14:01:08,373 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 3112 treesize of output 3110 [2024-10-29 14:01:08,422 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 3124 treesize of output 3120 [2024-10-29 14:01:08,476 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 3120 treesize of output 3118 [2024-10-29 14:01:08,520 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 3118 treesize of output 3116 [2024-10-29 14:01:08,566 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 3116 treesize of output 3112 [2024-10-29 14:01:08,614 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 3112 treesize of output 3110 [2024-10-29 14:01:08,664 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 3110 treesize of output 3106 [2024-10-29 14:01:08,712 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 3106 treesize of output 3104 [2024-10-29 14:01:08,761 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 3118 treesize of output 3110 [2024-10-29 14:01:08,827 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 3098 treesize of output 3094 [2024-10-29 14:01:08,885 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 3095 treesize of output 3091 [2024-10-29 14:01:08,955 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 3089 treesize of output 3085 [2024-10-29 14:01:09,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 3075 treesize of output 3073 [2024-10-29 14:01:09,085 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 3066 treesize of output 3064 [2024-10-29 14:01:09,134 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 3064 treesize of output 3060 [2024-10-29 14:01:09,181 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 3060 treesize of output 3058 [2024-10-29 14:01:09,233 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 3082 treesize of output 3074 [2024-10-29 14:01:09,293 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 3052 treesize of output 3048 [2024-10-29 14:01:09,345 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 3048 treesize of output 3046 [2024-10-29 14:01:09,399 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 3058 treesize of output 3050 [2024-10-29 14:01:09,451 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 3050 treesize of output 3048 [2024-10-29 14:01:09,505 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 3052 treesize of output 3050 [2024-10-29 14:01:09,571 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 3039 treesize of output 3037 [2024-10-29 14:01:09,633 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 3031 treesize of output 3029 [2024-10-29 14:01:09,699 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 3022 treesize of output 3018 [2024-10-29 14:01:09,754 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 3018 treesize of output 3016 [2024-10-29 14:01:09,808 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 3017 treesize of output 3015 [2024-10-29 14:01:09,865 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 3009 treesize of output 3005 [2024-10-29 14:01:09,940 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 2999 treesize of output 2997 [2024-10-29 14:01:10,007 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 2991 treesize of output 2989 [2024-10-29 14:01:10,062 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 3003 treesize of output 2995 [2024-10-29 14:01:10,135 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 2997 treesize of output 2993 [2024-10-29 14:01:10,189 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 2993 treesize of output 2989 [2024-10-29 14:01:10,245 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 3001 treesize of output 2993 [2024-10-29 14:01:10,299 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 2993 treesize of output 2991 [2024-10-29 14:01:10,362 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 2991 treesize of output 2989 [2024-10-29 14:01:10,415 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 2989 treesize of output 2983 [2024-10-29 14:01:10,470 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 2985 treesize of output 2973 [2024-10-29 14:01:10,539 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 2959 treesize of output 2957 [2024-10-29 14:01:10,597 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 2957 treesize of output 2955 [2024-10-29 14:01:10,662 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 2960 treesize of output 2958 [2024-10-29 14:01:10,725 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 2958 treesize of output 2956 [2024-10-29 14:01:10,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 2956 treesize of output 2954 [2024-10-29 14:01:10,836 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 2968 treesize of output 2964 [2024-10-29 14:01:10,891 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 2964 treesize of output 2962 [2024-10-29 14:01:10,945 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 2962 treesize of output 2958 [2024-10-29 14:01:11,000 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 2958 treesize of output 2956 [2024-10-29 14:01:12,023 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 6 treesize of output 4 [2024-10-29 14:01:12,033 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 5 treesize of output 3 [2024-10-29 14:01:12,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:01:12,053 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 403 treesize of output 401 [2024-10-29 14:01:12,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 14:01:12,653 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 518 treesize of output 500 [2024-10-29 14:02:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-29 14:02:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883694551] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-29 14:02:26,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-29 14:02:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 32, 36] total 105 [2024-10-29 14:02:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606916996] [2024-10-29 14:02:26,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-29 14:02:26,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-10-29 14:02:26,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 14:02:26,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-10-29 14:02:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=6779, Unknown=49, NotChecked=3740, Total=11130 [2024-10-29 14:02:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 14:02:26,035 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 14:02:26,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 6.561904761904762) internal successors, (689), 106 states have internal predecessors, (689), 0 states have call successors, (0), 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-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-29 14:02:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.