/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-patterns/array11_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:21:13,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:21:13,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 19:21:13,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:21:13,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:21:13,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:21:13,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:21:13,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:21:13,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:21:13,593 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:21:13,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:21:13,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:21:13,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:21:13,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:21:13,595 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:21:13,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:21:13,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:21:13,596 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:21:13,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:21:13,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:21:13,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:21:13,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:21:13,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:21:13,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:21:13,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:21:13,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:21:13,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:21:13,600 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:21:13,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:21:13,600 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:21:13,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:21:13,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:21:13,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:21:13,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:21:13,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:21:13,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:21:13,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:21:13,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:21:13,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:21:13,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:21:13,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:21:13,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:21:13,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:21:13,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:21:13,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:21:13,604 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:21:13,604 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 19:21:13,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:21:13,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:21:13,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:21:13,799 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:21:13,799 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:21:13,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array11_pattern.c [2023-12-21 19:21:14,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:21:15,069 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:21:15,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c [2023-12-21 19:21:15,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e81b7fb0/f403ab3edb004c96995a08a148a5bc8b/FLAGe11dd9a11 [2023-12-21 19:21:15,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e81b7fb0/f403ab3edb004c96995a08a148a5bc8b [2023-12-21 19:21:15,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:21:15,096 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:21:15,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:21:15,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:21:15,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:21:15,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390dc818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15, skipping insertion in model container [2023-12-21 19:21:15,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,122 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:21:15,277 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c[1357,1370] [2023-12-21 19:21:15,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:21:15,305 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:21:15,315 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c[1357,1370] [2023-12-21 19:21:15,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:21:15,337 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:21:15,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15 WrapperNode [2023-12-21 19:21:15,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:21:15,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:21:15,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:21:15,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:21:15,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,365 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2023-12-21 19:21:15,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:21:15,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:21:15,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:21:15,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:21:15,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,389 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-12-21 19:21:15,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:21:15,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:21:15,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:21:15,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:21:15,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (1/1) ... [2023-12-21 19:21:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:21:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:21:15,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 19:21:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 19:21:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:21:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:21:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:21:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 19:21:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 19:21:15,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 19:21:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:21:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:21:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:21:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 19:21:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:21:15,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:21:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:21:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:21:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:21:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 19:21:15,587 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:21:15,589 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:21:15,781 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:21:15,808 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:21:15,808 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 19:21:15,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:21:15 BoogieIcfgContainer [2023-12-21 19:21:15,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:21:15,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:21:15,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:21:15,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:21:15,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:21:15" (1/3) ... [2023-12-21 19:21:15,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5840bdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:21:15, skipping insertion in model container [2023-12-21 19:21:15,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:21:15" (2/3) ... [2023-12-21 19:21:15,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5840bdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:21:15, skipping insertion in model container [2023-12-21 19:21:15,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:21:15" (3/3) ... [2023-12-21 19:21:15,816 INFO L112 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2023-12-21 19:21:15,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:21:15,839 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:21:15,871 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:21:15,875 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@fb4c4a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:21:15,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:21:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 19:21:15,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:21:15,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:21:15,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:21:15,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:21:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -208916493, now seen corresponding path program 1 times [2023-12-21 19:21:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:21:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809360173] [2023-12-21 19:21:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:21:15,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:15,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:21:15,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:21:15,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 19:21:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:21:15,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 19:21:15,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:21:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:21:15,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:21:15,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:21:15,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809360173] [2023-12-21 19:21:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809360173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:21:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:21:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:21:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719309140] [2023-12-21 19:21:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:21:15,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 19:21:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:21:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 19:21:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:21:16,017 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:21:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:21:16,050 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2023-12-21 19:21:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 19:21:16,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-21 19:21:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:21:16,057 INFO L225 Difference]: With dead ends: 38 [2023-12-21 19:21:16,057 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 19:21:16,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:21:16,065 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:21:16,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:21:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 19:21:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-21 19:21:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-21 19:21:16,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2023-12-21 19:21:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:21:16,100 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-21 19:21:16,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:21:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-21 19:21:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 19:21:16,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:21:16,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:21:16,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 19:21:16,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:16,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:21:16,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:21:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1520585160, now seen corresponding path program 1 times [2023-12-21 19:21:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:21:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776917127] [2023-12-21 19:21:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:21:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:21:16,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:21:16,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 19:21:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:21:16,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 19:21:16,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:21:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:21:16,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:21:16,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:21:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776917127] [2023-12-21 19:21:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776917127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:21:16,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:21:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 19:21:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683650649] [2023-12-21 19:21:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:21:16,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 19:21:16,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:21:16,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 19:21:16,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 19:21:16,523 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:21:16,580 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-12-21 19:21:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 19:21:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-21 19:21:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:21:16,581 INFO L225 Difference]: With dead ends: 23 [2023-12-21 19:21:16,582 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 19:21:16,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 19:21:16,583 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:21:16,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:21:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 19:21:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-21 19:21:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-21 19:21:16,589 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 21 [2023-12-21 19:21:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:21:16,590 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-21 19:21:16,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-21 19:21:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 19:21:16,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:21:16,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:21:16,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 19:21:16,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:16,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:21:16,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:21:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash 133041195, now seen corresponding path program 1 times [2023-12-21 19:21:16,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:21:16,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577245083] [2023-12-21 19:21:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:21:16,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:16,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:21:16,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:21:16,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 19:21:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:21:16,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:21:16,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:21:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:21:17,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:21:17,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:21:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577245083] [2023-12-21 19:21:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577245083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:21:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:21:17,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:21:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349971898] [2023-12-21 19:21:17,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:21:17,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:21:17,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:21:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:21:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:21:17,175 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:21:17,491 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2023-12-21 19:21:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:21:17,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-21 19:21:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:21:17,493 INFO L225 Difference]: With dead ends: 39 [2023-12-21 19:21:17,493 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 19:21:17,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:21:17,494 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:21:17,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:21:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 19:21:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-21 19:21:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-12-21 19:21:17,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2023-12-21 19:21:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:21:17,502 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-12-21 19:21:17,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:21:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-12-21 19:21:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 19:21:17,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:21:17,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:21:17,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 19:21:17,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:17,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:21:17,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:21:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1617342797, now seen corresponding path program 1 times [2023-12-21 19:21:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:21:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727123920] [2023-12-21 19:21:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:21:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:21:17,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:21:17,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:21:17,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 19:21:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:21:17,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 19:21:17,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:21:18,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 47 [2023-12-21 19:21:18,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:21:18,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 68 [2023-12-21 19:21:18,862 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 29 treesize of output 25 [2023-12-21 19:21:21,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:21:21,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:21:21,910 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 41 treesize of output 32 [2023-12-21 19:21:21,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:21:21,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:21:21,986 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 39 treesize of output 30 [2023-12-21 19:21:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:21:23,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:21:24,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2023-12-21 19:21:24,253 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 107 treesize of output 103 [2023-12-21 19:21:24,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-12-21 19:21:24,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:21:24,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 69 [2023-12-21 19:21:27,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:21:27,670 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 350 treesize of output 338 [2023-12-21 19:22:17,704 WARN L293 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:22:17,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:22:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727123920] [2023-12-21 19:22:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727123920] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:22:17,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [27556536] [2023-12-21 19:22:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:22:17,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:22:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:22:17,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:22:17,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-21 19:22:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:22:17,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 19:22:17,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:22:21,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 47 [2023-12-21 19:22:21,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:22:21,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 68 [2023-12-21 19:22:21,398 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 29 treesize of output 25 [2023-12-21 19:22:21,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 35 treesize of output 8 [2023-12-21 19:22:23,446 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:22:23,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:22:23,525 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 41 treesize of output 32 [2023-12-21 19:22:23,538 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:22:23,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:22:23,592 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 39 treesize of output 30 [2023-12-21 19:22:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:22:24,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:22:24,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2023-12-21 19:22:24,523 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 107 treesize of output 103 [2023-12-21 19:22:24,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-12-21 19:22:25,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:22:25,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 69 [2023-12-21 19:22:34,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:22:34,482 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 707 treesize of output 681 [2023-12-21 19:23:16,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse153 ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (= (bvmul .cse153 (_ bv4 32)) (_ bv0 32))) (.cse0 (= (bvadd |c_ULTIMATE.start_main_~index~0#1| (_ bv1 64)) c_~ARR_SIZE~0))) (let ((.cse92 (not .cse0)) (.cse13 (not .cse1)) (.cse4 (bvmul (_ bv2 64) c_~ARR_SIZE~0)) (.cse3 ((_ sign_extend 32) .cse153))) (and (or .cse0 (let ((.cse25 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse91 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (bvadd .cse91 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse91 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse7 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse8 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse7))) (let ((.cse6 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse5 ((_ sign_extend 32) ((_ extract 31 0) .cse8))) (.cse2 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse7 (bvmul .cse7 (bvmul .cse8 .cse7))))))) (or (= (bvadd (_ bv2 64) .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse2 .cse5 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse6 .cse5 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse6 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse6 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse2 .cse5 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (or (forall ((v_prenex_17 (_ BitVec 32))) (let ((.cse11 ((_ sign_extend 32) v_prenex_17))) (let ((.cse12 (bvmul .cse11 |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse9 ((_ sign_extend 32) ((_ extract 31 0) .cse12))) (.cse10 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse12 .cse11))))))) (or (= (_ bv0 64) (bvadd .cse9 .cse10 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd (_ bv2 64) .cse9 .cse10 |c_ULTIMATE.start_main_~sum~0#1|) .cse4)))))) .cse13) (or .cse1 (forall ((v_prenex_18 (_ BitVec 32))) (= (_ bv0 64) (bvadd ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse14 ((_ sign_extend 32) v_prenex_18))) (bvmul (bvmul .cse14 (bvmul .cse14 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse14))) .cse14)))) .cse3 |c_ULTIMATE.start_main_~sum~0#1|))) (forall ((v_prenex_19 (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 32) v_prenex_19))) (or (= (bvadd (_ bv2 64) .cse15 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd .cse15 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse19 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse20 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse19))) (let ((.cse17 ((_ sign_extend 32) ((_ extract 31 0) .cse20))) (.cse18 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse19 (bvmul .cse19 (bvmul .cse20 .cse19))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse16 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse16 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse16 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse16 (_ bv2 64) .cse17 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse18 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse18 .cse17 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse18 .cse17 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse18 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (or .cse1 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse23 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse24 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse23))) (let ((.cse22 ((_ sign_extend 32) ((_ extract 31 0) .cse24))) (.cse21 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse23 (bvmul .cse23 (bvmul .cse24 .cse23))))))) (or (= (bvadd (_ bv2 64) .cse21 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse21 .cse22 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse21 .cse22 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse21 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse25) (or .cse13 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse29 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse30 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse29))) (let ((.cse28 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse27 ((_ sign_extend 32) ((_ extract 31 0) .cse30))) (.cse26 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse29 (bvmul .cse29 (bvmul .cse30 .cse29))))))) (or (= (bvadd (_ bv2 64) .cse26 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse26 .cse27 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse28 .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse28 (_ bv2 64) .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse26 .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse26 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (or (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse34 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse35 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse34))) (let ((.cse32 ((_ sign_extend 32) ((_ extract 31 0) .cse35))) (.cse33 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse34 (bvmul .cse34 (bvmul .cse35 .cse34))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse31 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse31 .cse32 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse31 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse31 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse31 (_ bv2 64) .cse32 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse33 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse33 .cse32 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse33 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse40 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse39 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse40))) (let ((.cse36 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse40 (bvmul .cse40 (bvmul .cse39 .cse40)))))) (.cse37 ((_ sign_extend 32) ((_ extract 31 0) .cse39)))) (or (= (bvadd (_ bv2 64) .cse36 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse36 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse38 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse38 .cse37 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse38 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse38 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse42 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse43))) (let ((.cse41 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse43 (bvmul .cse43 (bvmul .cse42 .cse43))))))) (or (= (bvadd (_ bv2 64) .cse41 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse41 ((_ sign_extend 32) ((_ extract 31 0) .cse42)) |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse41 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse25)) .cse1) (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse44 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse45 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse45 (bvmul .cse45 (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse45) .cse45)))))))) (or (= (bvadd (_ bv2 64) .cse44 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse44 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))) .cse25) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse50 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse48 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse50))) (let ((.cse49 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse50 (bvmul .cse50 (bvmul .cse48 .cse50))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse46 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse47 ((_ sign_extend 32) ((_ extract 31 0) .cse48)))) (or (= (_ bv0 64) (bvadd .cse46 .cse47 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse46 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse46 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse46 (_ bv2 64) .cse47 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse49 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse49 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse54 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse53 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse54))) (let ((.cse51 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse54 (bvmul .cse54 (bvmul .cse53 .cse54))))))) (or (= (bvadd (_ bv2 64) .cse51 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse51 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse52 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse52 ((_ sign_extend 32) ((_ extract 31 0) .cse53)) |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse52 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse52 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))))))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse58 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse59 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse58))) (let ((.cse57 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse56 ((_ sign_extend 32) ((_ extract 31 0) .cse59))) (.cse55 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse58 (bvmul .cse58 (bvmul .cse59 .cse58))))))) (or (= (bvadd (_ bv2 64) .cse55 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse55 .cse56 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse57 .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse57 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse57 (_ bv2 64) .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse55 .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse55 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse13) (or .cse1 (forall ((v_prenex_21 (_ BitVec 32))) (let ((.cse60 ((_ sign_extend 32) v_prenex_21))) (or (= .cse4 (bvadd (_ bv2 64) .cse3 .cse60 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse3 .cse60 |c_ULTIMATE.start_main_~sum~0#1|)))))) (or (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse65 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse64))) (let ((.cse62 ((_ sign_extend 32) ((_ extract 31 0) .cse65))) (.cse61 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse64 (bvmul .cse64 (bvmul .cse65 .cse64))))))) (or (= (bvadd (_ bv2 64) .cse61 .cse62 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse63 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse63 .cse62 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse63 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse63 (_ bv2 64) .cse62 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse61 .cse62 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse61 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse69 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse70 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse69))) (let ((.cse67 ((_ sign_extend 32) ((_ extract 31 0) .cse70))) (.cse68 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse69 (bvmul .cse69 (bvmul .cse70 .cse69))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse66 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse66 .cse67 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse66 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse66 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse66 (_ bv2 64) .cse67 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse68 .cse67 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse68 .cse67 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse68 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse74 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse75 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse74))) (let ((.cse72 ((_ sign_extend 32) ((_ extract 31 0) .cse75))) (.cse71 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse74 (bvmul .cse74 (bvmul .cse75 .cse74))))))) (or (= (bvadd (_ bv2 64) .cse71 .cse72 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse71 .cse72 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse73 .cse72 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse73 (_ bv2 64) .cse72 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse71 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) .cse13) (or .cse13 (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse80 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse79 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse80))) (let ((.cse76 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse80 (bvmul .cse80 (bvmul .cse79 .cse80)))))) (.cse77 ((_ sign_extend 32) ((_ extract 31 0) .cse79)))) (or (= (bvadd (_ bv2 64) .cse76 .cse77 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse76 .cse77 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse78 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse78 .cse77 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse78 (_ bv2 64) .cse77 |c_ULTIMATE.start_main_~sum~0#1|)))))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse84 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse85))) (let ((.cse81 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse85 (bvmul .cse85 (bvmul .cse84 .cse85)))))) (.cse82 ((_ sign_extend 32) ((_ extract 31 0) .cse84)))) (or (= (bvadd (_ bv2 64) .cse81 .cse82 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse83 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse83 .cse82 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse83 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse83 (_ bv2 64) .cse82 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse81 .cse82 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse89 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse90))) (let ((.cse88 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse90 (bvmul .cse90 (bvmul .cse89 .cse90)))))) (.cse87 ((_ sign_extend 32) ((_ extract 31 0) .cse89)))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse86 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse86 .cse87 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse86 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse86 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse86 (_ bv2 64) .cse87 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse88 .cse87 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse88 .cse87 |c_ULTIMATE.start_main_~sum~0#1|)))))))))))) (or .cse1 (and (or .cse92 (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (let ((.cse93 ((_ sign_extend 32) v_prenex_16)) (.cse94 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= .cse4 (bvadd (_ bv2 64) .cse93 .cse94 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse93 .cse94 |c_ULTIMATE.start_main_~sum~0#1|)))))) (or .cse0 (and (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse100 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse99 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse100))) (let ((.cse95 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse100 (bvmul .cse100 (bvmul .cse99 .cse100)))))) (.cse96 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse95 .cse96 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse98 ((_ sign_extend 32) ((_ extract 31 0) .cse99))) (.cse97 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse97 .cse98 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse97 .cse96 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse97 (_ bv2 64) .cse98 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse97 (_ bv2 64) .cse96 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse95 .cse96 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse105 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse104 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse105))) (let ((.cse101 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse105 (bvmul .cse105 (bvmul .cse104 .cse105)))))) (.cse102 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse101 .cse102 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse103 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse103 ((_ sign_extend 32) ((_ extract 31 0) .cse104)) |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse103 .cse102 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse103 (_ bv2 64) .cse102 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse101 .cse102 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse111 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse110))) (let ((.cse108 ((_ sign_extend 32) ((_ extract 31 0) .cse111))) (.cse106 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse110 (bvmul .cse110 (bvmul .cse111 .cse110)))))) (.cse107 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse106 .cse107 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse106 .cse108 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse109 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse109 .cse108 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse109 .cse107 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse109 (_ bv2 64) .cse108 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse109 (_ bv2 64) .cse107 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse106 .cse107 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse117 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse116 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse117))) (let ((.cse113 ((_ sign_extend 32) v_arrayElimCell_21)) (.cse112 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse117 (bvmul .cse117 (bvmul .cse116 .cse117)))))) (.cse114 ((_ sign_extend 32) ((_ extract 31 0) .cse116)))) (or (= (bvadd (_ bv2 64) .cse112 .cse113 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse112 .cse114 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse115 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse115 .cse114 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse115 .cse113 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse115 (_ bv2 64) .cse114 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse115 (_ bv2 64) .cse113 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse112 .cse113 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse112 .cse114 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse119 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse121 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse120 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse121))) (let ((.cse118 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse121 (bvmul .cse121 (bvmul .cse120 .cse121))))))) (or (= (bvadd (_ bv2 64) .cse118 .cse119 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse118 ((_ sign_extend 32) ((_ extract 31 0) .cse120)) |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse118 .cse119 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse122 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse122 .cse119 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse122 (_ bv2 64) .cse119 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse128 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse127 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse128))) (let ((.cse123 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse128 (bvmul .cse128 (bvmul .cse127 .cse128)))))) (.cse125 ((_ sign_extend 32) ((_ extract 31 0) .cse127))) (.cse126 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse124 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse123 .cse124 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse123 .cse125 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse126 .cse125 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse126 .cse124 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse123 .cse124 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse123 .cse125 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse126 (_ bv2 64) .cse124 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse133 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse134 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse133))) (let ((.cse131 ((_ sign_extend 32) ((_ extract 31 0) .cse134))) (.cse129 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse133 (bvmul .cse133 (bvmul .cse134 .cse133)))))) (.cse130 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse129 .cse130 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse129 .cse131 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse132 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse132 .cse131 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse132 .cse130 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse132 (_ bv2 64) .cse130 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse129 .cse130 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_prenex_21 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse135 ((_ sign_extend 32) v_prenex_21)) (.cse136 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd .cse135 .cse136 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)) (= .cse4 (bvadd (_ bv2 64) .cse135 .cse136 |c_ULTIMATE.start_main_~sum~0#1|))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse138 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse140 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse141))) (let ((.cse137 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse141 (bvmul .cse141 (bvmul .cse140 .cse141)))))) (.cse139 ((_ sign_extend 32) ((_ extract 31 0) .cse140)))) (or (= (bvadd (_ bv2 64) .cse137 .cse138 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse137 .cse139 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse137 .cse138 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse137 .cse139 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse142 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse142 .cse138 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse142 (_ bv2 64) .cse138 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse144 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse143 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse145 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse145 (bvmul .cse145 (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse145) .cse145)))))))) (or (= (bvadd (_ bv2 64) .cse143 .cse144 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse143 .cse144 |c_ULTIMATE.start_main_~sum~0#1|))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse146 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse146 .cse144 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse146 (_ bv2 64) .cse144 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse148 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((v_prenex_18 (_ BitVec 32))) (= (_ bv0 64) (bvadd ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse147 ((_ sign_extend 32) v_prenex_18))) (bvmul (bvmul .cse147 (bvmul .cse147 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse147))) .cse147)))) .cse148 |c_ULTIMATE.start_main_~sum~0#1|))) (forall ((v_prenex_19 (_ BitVec 32))) (let ((.cse149 ((_ sign_extend 32) v_prenex_19))) (or (= (bvadd .cse149 .cse148 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)) (= (bvadd (_ bv2 64) .cse149 .cse148 |c_ULTIMATE.start_main_~sum~0#1|) .cse4))))))))))) (or .cse92 (and (forall ((v_prenex_16 (_ BitVec 32))) (let ((.cse150 ((_ sign_extend 32) v_prenex_16))) (or (= (_ bv0 64) (bvadd .cse150 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd (_ bv2 64) .cse150 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4)))) .cse13) (and .cse1 (forall ((v_prenex_22 (_ BitVec 32))) (let ((.cse151 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse152 ((_ sign_extend 32) v_prenex_22))) (bvmul (bvmul (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse152) .cse152) .cse152) .cse152)))))) (or (= (_ bv0 64) (bvadd .cse3 .cse151 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd (_ bv2 64) .cse3 .cse151 |c_ULTIMATE.start_main_~sum~0#1|))))))))))) is different from false [2023-12-21 19:23:21,182 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse153 ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (= (bvmul .cse153 (_ bv4 32)) (_ bv0 32))) (.cse0 (= (bvadd |c_ULTIMATE.start_main_~index~0#1| (_ bv1 64)) c_~ARR_SIZE~0))) (let ((.cse92 (not .cse0)) (.cse13 (not .cse1)) (.cse4 (bvmul (_ bv2 64) c_~ARR_SIZE~0)) (.cse3 ((_ sign_extend 32) .cse153))) (and (or .cse0 (let ((.cse25 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse91 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (bvadd .cse91 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse91 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse7 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse8 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse7))) (let ((.cse6 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse5 ((_ sign_extend 32) ((_ extract 31 0) .cse8))) (.cse2 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse7 (bvmul .cse7 (bvmul .cse8 .cse7))))))) (or (= (bvadd (_ bv2 64) .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse2 .cse5 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse6 .cse5 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse6 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse6 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse2 .cse5 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (or (forall ((v_prenex_17 (_ BitVec 32))) (let ((.cse11 ((_ sign_extend 32) v_prenex_17))) (let ((.cse12 (bvmul .cse11 |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse9 ((_ sign_extend 32) ((_ extract 31 0) .cse12))) (.cse10 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse12 .cse11))))))) (or (= (_ bv0 64) (bvadd .cse9 .cse10 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd (_ bv2 64) .cse9 .cse10 |c_ULTIMATE.start_main_~sum~0#1|) .cse4)))))) .cse13) (or .cse1 (forall ((v_prenex_18 (_ BitVec 32))) (= (_ bv0 64) (bvadd ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse14 ((_ sign_extend 32) v_prenex_18))) (bvmul (bvmul .cse14 (bvmul .cse14 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse14))) .cse14)))) .cse3 |c_ULTIMATE.start_main_~sum~0#1|))) (forall ((v_prenex_19 (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 32) v_prenex_19))) (or (= (bvadd (_ bv2 64) .cse15 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd .cse15 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse19 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse20 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse19))) (let ((.cse17 ((_ sign_extend 32) ((_ extract 31 0) .cse20))) (.cse18 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse19 (bvmul .cse19 (bvmul .cse20 .cse19))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse16 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse16 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse16 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse16 (_ bv2 64) .cse17 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse18 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse18 .cse17 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse18 .cse17 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse18 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (or .cse1 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse23 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse24 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse23))) (let ((.cse22 ((_ sign_extend 32) ((_ extract 31 0) .cse24))) (.cse21 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse23 (bvmul .cse23 (bvmul .cse24 .cse23))))))) (or (= (bvadd (_ bv2 64) .cse21 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse21 .cse22 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse21 .cse22 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse21 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse25) (or .cse13 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse29 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse30 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse29))) (let ((.cse28 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse27 ((_ sign_extend 32) ((_ extract 31 0) .cse30))) (.cse26 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse29 (bvmul .cse29 (bvmul .cse30 .cse29))))))) (or (= (bvadd (_ bv2 64) .cse26 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse26 .cse27 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse28 .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse28 (_ bv2 64) .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse26 .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse26 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (or (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse34 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse35 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse34))) (let ((.cse32 ((_ sign_extend 32) ((_ extract 31 0) .cse35))) (.cse33 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse34 (bvmul .cse34 (bvmul .cse35 .cse34))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse31 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse31 .cse32 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse31 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse31 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse31 (_ bv2 64) .cse32 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse33 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse33 .cse32 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse33 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse40 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse39 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse40))) (let ((.cse36 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse40 (bvmul .cse40 (bvmul .cse39 .cse40)))))) (.cse37 ((_ sign_extend 32) ((_ extract 31 0) .cse39)))) (or (= (bvadd (_ bv2 64) .cse36 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse36 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse38 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse38 .cse37 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse38 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse38 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse42 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse43))) (let ((.cse41 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse43 (bvmul .cse43 (bvmul .cse42 .cse43))))))) (or (= (bvadd (_ bv2 64) .cse41 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse41 ((_ sign_extend 32) ((_ extract 31 0) .cse42)) |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse41 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse25)) .cse1) (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse44 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse45 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse45 (bvmul .cse45 (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse45) .cse45)))))))) (or (= (bvadd (_ bv2 64) .cse44 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse44 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))) .cse25) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse50 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse48 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse50))) (let ((.cse49 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse50 (bvmul .cse50 (bvmul .cse48 .cse50))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse46 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse47 ((_ sign_extend 32) ((_ extract 31 0) .cse48)))) (or (= (_ bv0 64) (bvadd .cse46 .cse47 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse46 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse46 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse46 (_ bv2 64) .cse47 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse49 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse49 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse54 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse53 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse54))) (let ((.cse51 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse54 (bvmul .cse54 (bvmul .cse53 .cse54))))))) (or (= (bvadd (_ bv2 64) .cse51 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse51 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse52 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse52 ((_ sign_extend 32) ((_ extract 31 0) .cse53)) |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse52 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse52 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))))))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse58 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse59 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse58))) (let ((.cse57 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse56 ((_ sign_extend 32) ((_ extract 31 0) .cse59))) (.cse55 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse58 (bvmul .cse58 (bvmul .cse59 .cse58))))))) (or (= (bvadd (_ bv2 64) .cse55 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse55 .cse56 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse57 .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse57 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse57 (_ bv2 64) .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse55 .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse55 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse13) (or .cse1 (forall ((v_prenex_21 (_ BitVec 32))) (let ((.cse60 ((_ sign_extend 32) v_prenex_21))) (or (= .cse4 (bvadd (_ bv2 64) .cse3 .cse60 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse3 .cse60 |c_ULTIMATE.start_main_~sum~0#1|)))))) (or (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse65 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse64))) (let ((.cse62 ((_ sign_extend 32) ((_ extract 31 0) .cse65))) (.cse61 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse64 (bvmul .cse64 (bvmul .cse65 .cse64))))))) (or (= (bvadd (_ bv2 64) .cse61 .cse62 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse63 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse63 .cse62 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse63 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse63 (_ bv2 64) .cse62 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse61 .cse62 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse61 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse69 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse70 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse69))) (let ((.cse67 ((_ sign_extend 32) ((_ extract 31 0) .cse70))) (.cse68 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse69 (bvmul .cse69 (bvmul .cse70 .cse69))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse66 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse66 .cse67 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse66 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse66 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse66 (_ bv2 64) .cse67 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse68 .cse67 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse68 .cse67 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse68 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse74 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse75 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse74))) (let ((.cse72 ((_ sign_extend 32) ((_ extract 31 0) .cse75))) (.cse71 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse74 (bvmul .cse74 (bvmul .cse75 .cse74))))))) (or (= (bvadd (_ bv2 64) .cse71 .cse72 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse71 .cse72 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse73 .cse72 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse73 (_ bv2 64) .cse72 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse71 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) .cse13) (or .cse13 (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse80 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse79 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse80))) (let ((.cse76 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse80 (bvmul .cse80 (bvmul .cse79 .cse80)))))) (.cse77 ((_ sign_extend 32) ((_ extract 31 0) .cse79)))) (or (= (bvadd (_ bv2 64) .cse76 .cse77 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse76 .cse77 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse78 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse78 .cse77 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse78 (_ bv2 64) .cse77 |c_ULTIMATE.start_main_~sum~0#1|)))))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse84 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse85))) (let ((.cse81 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse85 (bvmul .cse85 (bvmul .cse84 .cse85)))))) (.cse82 ((_ sign_extend 32) ((_ extract 31 0) .cse84)))) (or (= (bvadd (_ bv2 64) .cse81 .cse82 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse83 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse83 .cse82 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse83 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse83 (_ bv2 64) .cse82 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse81 .cse82 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse89 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse90))) (let ((.cse88 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse90 (bvmul .cse90 (bvmul .cse89 .cse90)))))) (.cse87 ((_ sign_extend 32) ((_ extract 31 0) .cse89)))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse86 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse86 .cse87 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse86 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse86 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse86 (_ bv2 64) .cse87 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse88 .cse87 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse88 .cse87 |c_ULTIMATE.start_main_~sum~0#1|)))))))))))) (or .cse1 (and (or .cse92 (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (let ((.cse93 ((_ sign_extend 32) v_prenex_16)) (.cse94 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= .cse4 (bvadd (_ bv2 64) .cse93 .cse94 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse93 .cse94 |c_ULTIMATE.start_main_~sum~0#1|)))))) (or .cse0 (and (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse100 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse99 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse100))) (let ((.cse95 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse100 (bvmul .cse100 (bvmul .cse99 .cse100)))))) (.cse96 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse95 .cse96 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse98 ((_ sign_extend 32) ((_ extract 31 0) .cse99))) (.cse97 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse97 .cse98 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse97 .cse96 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse97 (_ bv2 64) .cse98 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse97 (_ bv2 64) .cse96 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse95 .cse96 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse105 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse104 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse105))) (let ((.cse101 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse105 (bvmul .cse105 (bvmul .cse104 .cse105)))))) (.cse102 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse101 .cse102 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse103 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse103 ((_ sign_extend 32) ((_ extract 31 0) .cse104)) |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse103 .cse102 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse103 (_ bv2 64) .cse102 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse101 .cse102 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse111 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse110))) (let ((.cse108 ((_ sign_extend 32) ((_ extract 31 0) .cse111))) (.cse106 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse110 (bvmul .cse110 (bvmul .cse111 .cse110)))))) (.cse107 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse106 .cse107 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse106 .cse108 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse109 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse109 .cse108 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse109 .cse107 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse109 (_ bv2 64) .cse108 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse109 (_ bv2 64) .cse107 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse106 .cse107 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse117 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse116 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse117))) (let ((.cse113 ((_ sign_extend 32) v_arrayElimCell_21)) (.cse112 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse117 (bvmul .cse117 (bvmul .cse116 .cse117)))))) (.cse114 ((_ sign_extend 32) ((_ extract 31 0) .cse116)))) (or (= (bvadd (_ bv2 64) .cse112 .cse113 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse112 .cse114 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse115 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse115 .cse114 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse115 .cse113 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse115 (_ bv2 64) .cse114 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse115 (_ bv2 64) .cse113 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse112 .cse113 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse112 .cse114 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse119 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse121 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse120 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse121))) (let ((.cse118 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse121 (bvmul .cse121 (bvmul .cse120 .cse121))))))) (or (= (bvadd (_ bv2 64) .cse118 .cse119 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse118 ((_ sign_extend 32) ((_ extract 31 0) .cse120)) |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse118 .cse119 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse122 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse122 .cse119 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse122 (_ bv2 64) .cse119 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse128 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse127 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse128))) (let ((.cse123 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse128 (bvmul .cse128 (bvmul .cse127 .cse128)))))) (.cse125 ((_ sign_extend 32) ((_ extract 31 0) .cse127))) (.cse126 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse124 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse123 .cse124 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse123 .cse125 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse126 .cse125 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse126 .cse124 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse123 .cse124 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse123 .cse125 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse126 (_ bv2 64) .cse124 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse133 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse134 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse133))) (let ((.cse131 ((_ sign_extend 32) ((_ extract 31 0) .cse134))) (.cse129 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse133 (bvmul .cse133 (bvmul .cse134 .cse133)))))) (.cse130 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse129 .cse130 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse129 .cse131 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse132 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse132 .cse131 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse132 .cse130 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse132 (_ bv2 64) .cse130 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse129 .cse130 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_prenex_21 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse135 ((_ sign_extend 32) v_prenex_21)) (.cse136 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd .cse135 .cse136 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)) (= .cse4 (bvadd (_ bv2 64) .cse135 .cse136 |c_ULTIMATE.start_main_~sum~0#1|))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse138 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse140 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse141))) (let ((.cse137 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse141 (bvmul .cse141 (bvmul .cse140 .cse141)))))) (.cse139 ((_ sign_extend 32) ((_ extract 31 0) .cse140)))) (or (= (bvadd (_ bv2 64) .cse137 .cse138 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse137 .cse139 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse137 .cse138 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse137 .cse139 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse142 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse142 .cse138 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse142 (_ bv2 64) .cse138 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse144 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse143 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse145 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse145 (bvmul .cse145 (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse145) .cse145)))))))) (or (= (bvadd (_ bv2 64) .cse143 .cse144 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse143 .cse144 |c_ULTIMATE.start_main_~sum~0#1|))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse146 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse146 .cse144 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse146 (_ bv2 64) .cse144 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse148 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((v_prenex_18 (_ BitVec 32))) (= (_ bv0 64) (bvadd ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse147 ((_ sign_extend 32) v_prenex_18))) (bvmul (bvmul .cse147 (bvmul .cse147 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse147))) .cse147)))) .cse148 |c_ULTIMATE.start_main_~sum~0#1|))) (forall ((v_prenex_19 (_ BitVec 32))) (let ((.cse149 ((_ sign_extend 32) v_prenex_19))) (or (= (bvadd .cse149 .cse148 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)) (= (bvadd (_ bv2 64) .cse149 .cse148 |c_ULTIMATE.start_main_~sum~0#1|) .cse4))))))))))) (or .cse92 (and (forall ((v_prenex_16 (_ BitVec 32))) (let ((.cse150 ((_ sign_extend 32) v_prenex_16))) (or (= (_ bv0 64) (bvadd .cse150 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd (_ bv2 64) .cse150 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4)))) .cse13) (and .cse1 (forall ((v_prenex_22 (_ BitVec 32))) (let ((.cse151 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse152 ((_ sign_extend 32) v_prenex_22))) (bvmul (bvmul (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse152) .cse152) .cse152) .cse152)))))) (or (= (_ bv0 64) (bvadd .cse3 .cse151 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd (_ bv2 64) .cse3 .cse151 |c_ULTIMATE.start_main_~sum~0#1|))))))))))) is different from true [2023-12-21 19:23:54,795 WARN L876 $PredicateComparison]: unable to prove that (or (not (bvslt |c_ULTIMATE.start_main_~index~0#1| c_~ARR_SIZE~0)) (let ((.cse153 ((_ extract 31 0) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (= (bvmul .cse153 (_ bv4 32)) (_ bv0 32))) (.cse0 (= (bvadd |c_ULTIMATE.start_main_~index~0#1| (_ bv1 64)) c_~ARR_SIZE~0))) (let ((.cse92 (not .cse0)) (.cse13 (not .cse1)) (.cse4 (bvmul (_ bv2 64) c_~ARR_SIZE~0)) (.cse3 ((_ sign_extend 32) .cse153))) (and (or .cse0 (let ((.cse25 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse91 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (bvadd .cse91 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse91 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse7 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse8 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse7))) (let ((.cse6 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse5 ((_ sign_extend 32) ((_ extract 31 0) .cse8))) (.cse2 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse7 (bvmul .cse7 (bvmul .cse8 .cse7))))))) (or (= (bvadd (_ bv2 64) .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse2 .cse5 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse6 .cse5 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse6 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse6 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse2 .cse5 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (or (forall ((v_prenex_17 (_ BitVec 32))) (let ((.cse11 ((_ sign_extend 32) v_prenex_17))) (let ((.cse12 (bvmul .cse11 |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse9 ((_ sign_extend 32) ((_ extract 31 0) .cse12))) (.cse10 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse11 (bvmul .cse11 (bvmul .cse12 .cse11))))))) (or (= (_ bv0 64) (bvadd .cse9 .cse10 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd (_ bv2 64) .cse9 .cse10 |c_ULTIMATE.start_main_~sum~0#1|) .cse4)))))) .cse13) (or .cse1 (forall ((v_prenex_18 (_ BitVec 32))) (= (_ bv0 64) (bvadd ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse14 ((_ sign_extend 32) v_prenex_18))) (bvmul (bvmul .cse14 (bvmul .cse14 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse14))) .cse14)))) .cse3 |c_ULTIMATE.start_main_~sum~0#1|))) (forall ((v_prenex_19 (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 32) v_prenex_19))) (or (= (bvadd (_ bv2 64) .cse15 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd .cse15 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse19 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse20 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse19))) (let ((.cse17 ((_ sign_extend 32) ((_ extract 31 0) .cse20))) (.cse18 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse19 (bvmul .cse19 (bvmul .cse20 .cse19))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse16 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse16 .cse17 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse16 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse16 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse16 (_ bv2 64) .cse17 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse18 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse18 .cse17 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse18 .cse17 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse18 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (or .cse1 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse23 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse24 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse23))) (let ((.cse22 ((_ sign_extend 32) ((_ extract 31 0) .cse24))) (.cse21 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse23 (bvmul .cse23 (bvmul .cse24 .cse23))))))) (or (= (bvadd (_ bv2 64) .cse21 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse21 .cse22 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse21 .cse22 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse21 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse25) (or .cse13 (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse29 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse30 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse29))) (let ((.cse28 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse27 ((_ sign_extend 32) ((_ extract 31 0) .cse30))) (.cse26 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse29 (bvmul .cse29 (bvmul .cse30 .cse29))))))) (or (= (bvadd (_ bv2 64) .cse26 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse26 .cse27 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse28 .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse28 (_ bv2 64) .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse26 .cse27 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse26 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (or (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse34 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse35 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse34))) (let ((.cse32 ((_ sign_extend 32) ((_ extract 31 0) .cse35))) (.cse33 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse34 (bvmul .cse34 (bvmul .cse35 .cse34))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse31 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse31 .cse32 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse31 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse31 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse31 (_ bv2 64) .cse32 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse33 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse33 .cse32 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse33 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse40 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse39 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse40))) (let ((.cse36 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse40 (bvmul .cse40 (bvmul .cse39 .cse40)))))) (.cse37 ((_ sign_extend 32) ((_ extract 31 0) .cse39)))) (or (= (bvadd (_ bv2 64) .cse36 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse36 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse38 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse38 .cse37 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse38 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse38 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse42 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse43))) (let ((.cse41 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse43 (bvmul .cse43 (bvmul .cse42 .cse43))))))) (or (= (bvadd (_ bv2 64) .cse41 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse41 ((_ sign_extend 32) ((_ extract 31 0) .cse42)) |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse41 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse25)) .cse1) (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse44 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse45 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse45 (bvmul .cse45 (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse45) .cse45)))))))) (or (= (bvadd (_ bv2 64) .cse44 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse44 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))) .cse25) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse50 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse48 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse50))) (let ((.cse49 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse50 (bvmul .cse50 (bvmul .cse48 .cse50))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse46 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse47 ((_ sign_extend 32) ((_ extract 31 0) .cse48)))) (or (= (_ bv0 64) (bvadd .cse46 .cse47 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse46 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse46 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse46 (_ bv2 64) .cse47 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse49 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse49 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse54 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse53 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse54))) (let ((.cse51 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse54 (bvmul .cse54 (bvmul .cse53 .cse54))))))) (or (= (bvadd (_ bv2 64) .cse51 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse51 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse52 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse52 ((_ sign_extend 32) ((_ extract 31 0) .cse53)) |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse52 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse52 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))))))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse58 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse59 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse58))) (let ((.cse57 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse56 ((_ sign_extend 32) ((_ extract 31 0) .cse59))) (.cse55 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse58 (bvmul .cse58 (bvmul .cse59 .cse58))))))) (or (= (bvadd (_ bv2 64) .cse55 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse55 .cse56 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse57 .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse57 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse57 (_ bv2 64) .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse55 .cse56 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse55 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) .cse13) (or .cse1 (forall ((v_prenex_21 (_ BitVec 32))) (let ((.cse60 ((_ sign_extend 32) v_prenex_21))) (or (= .cse4 (bvadd (_ bv2 64) .cse3 .cse60 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse3 .cse60 |c_ULTIMATE.start_main_~sum~0#1|)))))) (or (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse65 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse64))) (let ((.cse62 ((_ sign_extend 32) ((_ extract 31 0) .cse65))) (.cse61 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse64 (bvmul .cse64 (bvmul .cse65 .cse64))))))) (or (= (bvadd (_ bv2 64) .cse61 .cse62 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse63 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse63 .cse62 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse63 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse63 (_ bv2 64) .cse62 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse61 .cse62 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse61 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse69 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse70 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse69))) (let ((.cse67 ((_ sign_extend 32) ((_ extract 31 0) .cse70))) (.cse68 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse69 (bvmul .cse69 (bvmul .cse70 .cse69))))))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse66 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse66 .cse67 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse66 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse66 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse66 (_ bv2 64) .cse67 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse68 .cse67 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse68 .cse67 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse68 .cse3 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse74 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse75 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse74))) (let ((.cse72 ((_ sign_extend 32) ((_ extract 31 0) .cse75))) (.cse71 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse74 (bvmul .cse74 (bvmul .cse75 .cse74))))))) (or (= (bvadd (_ bv2 64) .cse71 .cse72 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse71 .cse72 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse73 .cse72 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse73 (_ bv2 64) .cse72 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse71 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)))))))) .cse13) (or .cse13 (and (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse80 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse79 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse80))) (let ((.cse76 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse80 (bvmul .cse80 (bvmul .cse79 .cse80)))))) (.cse77 ((_ sign_extend 32) ((_ extract 31 0) .cse79)))) (or (= (bvadd (_ bv2 64) .cse76 .cse77 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse76 .cse77 |c_ULTIMATE.start_main_~sum~0#1|)) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse78 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse78 .cse77 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse78 (_ bv2 64) .cse77 |c_ULTIMATE.start_main_~sum~0#1|)))))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse84 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse85))) (let ((.cse81 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse85 (bvmul .cse85 (bvmul .cse84 .cse85)))))) (.cse82 ((_ sign_extend 32) ((_ extract 31 0) .cse84)))) (or (= (bvadd (_ bv2 64) .cse81 .cse82 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse83 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse83 .cse82 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse83 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse83 (_ bv2 64) .cse82 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse81 .cse82 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse89 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse90))) (let ((.cse88 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse90 (bvmul .cse90 (bvmul .cse89 .cse90)))))) (.cse87 ((_ sign_extend 32) ((_ extract 31 0) .cse89)))) (or (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse86 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse86 .cse87 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd .cse86 (_ bv2 64) .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse86 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse86 (_ bv2 64) .cse87 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (bvadd (_ bv2 64) .cse88 .cse87 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse88 .cse87 |c_ULTIMATE.start_main_~sum~0#1|)))))))))))) (or .cse1 (and (or .cse92 (forall ((v_arrayElimCell_21 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (let ((.cse93 ((_ sign_extend 32) v_prenex_16)) (.cse94 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= .cse4 (bvadd (_ bv2 64) .cse93 .cse94 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse93 .cse94 |c_ULTIMATE.start_main_~sum~0#1|)))))) (or .cse0 (and (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse100 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse99 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse100))) (let ((.cse95 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse100 (bvmul .cse100 (bvmul .cse99 .cse100)))))) (.cse96 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse95 .cse96 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse98 ((_ sign_extend 32) ((_ extract 31 0) .cse99))) (.cse97 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse97 .cse98 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse97 .cse96 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse97 (_ bv2 64) .cse98 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse97 (_ bv2 64) .cse96 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse95 .cse96 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse105 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse104 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse105))) (let ((.cse101 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse105 (bvmul .cse105 (bvmul .cse104 .cse105)))))) (.cse102 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse101 .cse102 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse103 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse103 ((_ sign_extend 32) ((_ extract 31 0) .cse104)) |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse103 .cse102 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse103 (_ bv2 64) .cse102 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse101 .cse102 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse111 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse110))) (let ((.cse108 ((_ sign_extend 32) ((_ extract 31 0) .cse111))) (.cse106 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse110 (bvmul .cse110 (bvmul .cse111 .cse110)))))) (.cse107 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse106 .cse107 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse106 .cse108 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse109 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse109 .cse108 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse109 .cse107 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse109 (_ bv2 64) .cse108 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse109 (_ bv2 64) .cse107 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse106 .cse107 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse117 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse116 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse117))) (let ((.cse113 ((_ sign_extend 32) v_arrayElimCell_21)) (.cse112 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse117 (bvmul .cse117 (bvmul .cse116 .cse117)))))) (.cse114 ((_ sign_extend 32) ((_ extract 31 0) .cse116)))) (or (= (bvadd (_ bv2 64) .cse112 .cse113 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse112 .cse114 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse115 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse115 .cse114 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse115 .cse113 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse115 (_ bv2 64) .cse114 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse115 (_ bv2 64) .cse113 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse112 .cse113 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse112 .cse114 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse119 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse121 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse120 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse121))) (let ((.cse118 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse121 (bvmul .cse121 (bvmul .cse120 .cse121))))))) (or (= (bvadd (_ bv2 64) .cse118 .cse119 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse118 ((_ sign_extend 32) ((_ extract 31 0) .cse120)) |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse118 .cse119 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse122 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse122 .cse119 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse122 (_ bv2 64) .cse119 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse128 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse127 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse128))) (let ((.cse123 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse128 (bvmul .cse128 (bvmul .cse127 .cse128)))))) (.cse125 ((_ sign_extend 32) ((_ extract 31 0) .cse127))) (.cse126 ((_ sign_extend 32) v_arrayElimCell_18)) (.cse124 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse123 .cse124 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse123 .cse125 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse126 .cse125 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse126 .cse124 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse123 .cse124 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse123 .cse125 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse126 (_ bv2 64) .cse124 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse133 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse134 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse133))) (let ((.cse131 ((_ sign_extend 32) ((_ extract 31 0) .cse134))) (.cse129 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse133 (bvmul .cse133 (bvmul .cse134 .cse133)))))) (.cse130 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd (_ bv2 64) .cse129 .cse130 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse129 .cse131 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse132 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse132 .cse131 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse132 .cse130 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse132 (_ bv2 64) .cse130 |c_ULTIMATE.start_main_~sum~0#1|))))) (= (_ bv0 64) (bvadd .cse129 .cse130 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_prenex_21 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse135 ((_ sign_extend 32) v_prenex_21)) (.cse136 ((_ sign_extend 32) v_arrayElimCell_21))) (or (= (bvadd .cse135 .cse136 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)) (= .cse4 (bvadd (_ bv2 64) .cse135 .cse136 |c_ULTIMATE.start_main_~sum~0#1|))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse138 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (let ((.cse140 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse141))) (let ((.cse137 ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse141 (bvmul .cse141 (bvmul .cse140 .cse141)))))) (.cse139 ((_ sign_extend 32) ((_ extract 31 0) .cse140)))) (or (= (bvadd (_ bv2 64) .cse137 .cse138 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (bvadd (_ bv2 64) .cse137 .cse139 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse137 .cse138 |c_ULTIMATE.start_main_~sum~0#1|)) (= (_ bv0 64) (bvadd .cse137 .cse139 |c_ULTIMATE.start_main_~sum~0#1|))))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse142 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse142 .cse138 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse142 (_ bv2 64) .cse138 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse144 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse143 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse145 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse145 (bvmul .cse145 (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse145) .cse145)))))))) (or (= (bvadd (_ bv2 64) .cse143 .cse144 |c_ULTIMATE.start_main_~sum~0#1|) .cse4) (= (_ bv0 64) (bvadd .cse143 .cse144 |c_ULTIMATE.start_main_~sum~0#1|))))) (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse146 ((_ sign_extend 32) v_arrayElimCell_18))) (or (= (_ bv0 64) (bvadd .cse146 .cse144 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd .cse146 (_ bv2 64) .cse144 |c_ULTIMATE.start_main_~sum~0#1|)))))))) (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse148 ((_ sign_extend 32) v_arrayElimCell_21))) (or (forall ((v_prenex_18 (_ BitVec 32))) (= (_ bv0 64) (bvadd ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse147 ((_ sign_extend 32) v_prenex_18))) (bvmul (bvmul .cse147 (bvmul .cse147 (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse147))) .cse147)))) .cse148 |c_ULTIMATE.start_main_~sum~0#1|))) (forall ((v_prenex_19 (_ BitVec 32))) (let ((.cse149 ((_ sign_extend 32) v_prenex_19))) (or (= (bvadd .cse149 .cse148 |c_ULTIMATE.start_main_~sum~0#1|) (_ bv0 64)) (= (bvadd (_ bv2 64) .cse149 .cse148 |c_ULTIMATE.start_main_~sum~0#1|) .cse4))))))))))) (or .cse92 (and (forall ((v_prenex_16 (_ BitVec 32))) (let ((.cse150 ((_ sign_extend 32) v_prenex_16))) (or (= (_ bv0 64) (bvadd .cse150 .cse3 |c_ULTIMATE.start_main_~sum~0#1|)) (= (bvadd (_ bv2 64) .cse150 .cse3 |c_ULTIMATE.start_main_~sum~0#1|) .cse4)))) .cse13) (and .cse1 (forall ((v_prenex_22 (_ BitVec 32))) (let ((.cse151 ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse152 ((_ sign_extend 32) v_prenex_22))) (bvmul (bvmul (bvmul (bvmul |c_ULTIMATE.start_main_~index~0#1| .cse152) .cse152) .cse152) .cse152)))))) (or (= (_ bv0 64) (bvadd .cse3 .cse151 |c_ULTIMATE.start_main_~sum~0#1|)) (= .cse4 (bvadd (_ bv2 64) .cse3 .cse151 |c_ULTIMATE.start_main_~sum~0#1|))))))))))) (not (bvsge |c_ULTIMATE.start_main_~index~0#1| (_ bv0 64)))) is different from true [2023-12-21 19:23:54,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [27556536] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:23:54,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:23:54,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 18 [2023-12-21 19:23:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712607522] [2023-12-21 19:23:54,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:23:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 19:23:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:23:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 19:23:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=482, Unknown=3, NotChecked=94, Total=702 [2023-12-21 19:23:54,808 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:24:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:19,935 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-12-21 19:24:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 19:24:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-21 19:24:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:19,956 INFO L225 Difference]: With dead ends: 46 [2023-12-21 19:24:19,956 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 19:24:19,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 83.9s TimeCoverageRelationStatistics Valid=265, Invalid=1000, Unknown=3, NotChecked=138, Total=1406 [2023-12-21 19:24:19,958 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:19,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 93 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-21 19:24:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 19:24:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 19:24:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:24:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-21 19:24:19,963 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2023-12-21 19:24:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:19,963 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-21 19:24:19,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:24:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-21 19:24:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 19:24:19,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:19,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:19,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:20,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-21 19:24:20,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:24:20,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:20,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash 386052203, now seen corresponding path program 2 times [2023-12-21 19:24:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945039945] [2023-12-21 19:24:20,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:24:20,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:20,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:20,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:20,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 19:24:20,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:24:20,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:20,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:24:20,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:24:24,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:24:27,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945039945] [2023-12-21 19:24:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945039945] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:27,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:24:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975370667] [2023-12-21 19:24:27,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:27,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:24:27,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:27,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:24:27,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:24:27,685 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:24:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:30,634 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-12-21 19:24:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 19:24:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-12-21 19:24:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:30,635 INFO L225 Difference]: With dead ends: 30 [2023-12-21 19:24:30,635 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 19:24:30,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-12-21 19:24:30,636 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:30,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-21 19:24:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 19:24:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 19:24:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 19:24:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-12-21 19:24:30,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2023-12-21 19:24:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:30,642 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-12-21 19:24:30,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:24:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-12-21 19:24:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 19:24:30,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:30,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:30,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:30,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:30,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:30,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash -890742696, now seen corresponding path program 3 times [2023-12-21 19:24:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:30,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161525880] [2023-12-21 19:24:30,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:24:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:30,846 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:30,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 19:24:30,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 19:24:30,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:30,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-21 19:24:31,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:32,667 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 11 treesize of output 7 [2023-12-21 19:24:32,774 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 11 treesize of output 7 [2023-12-21 19:24:33,553 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 19 treesize of output 18 [2023-12-21 19:24:33,707 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 19 treesize of output 18 [2023-12-21 19:24:40,649 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-21 19:24:40,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 88 treesize of output 85 [2023-12-21 19:24:41,694 INFO L349 Elim1Store]: treesize reduction 172, result has 19.2 percent of original size [2023-12-21 19:24:41,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 78 [2023-12-21 19:24:42,705 INFO L349 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2023-12-21 19:24:42,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 92 [2023-12-21 19:24:44,037 INFO L349 Elim1Store]: treesize reduction 68, result has 34.0 percent of original size [2023-12-21 19:24:44,037 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 50 treesize of output 54 [2023-12-21 19:24:57,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:24:57,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 339 treesize of output 487 [2023-12-21 19:24:59,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:24:59,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 292 treesize of output 416 [2023-12-21 19:25:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:25:33,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:26:24,005 WARN L293 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:26:55,096 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:27:30,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 316 [2023-12-21 19:27:30,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 308 [2023-12-21 19:27:31,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:27:31,440 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 50387 treesize of output 50003 [2023-12-21 19:27:32,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:27:32,120 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 126099 treesize of output 123795 Received shutdown request... [2023-12-21 19:35:45,438 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:35:45,461 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:35:46,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 19:35:46,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 19:35:46,514 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-21 19:35:46,518 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-21 19:35:46,520 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 19:35:46,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 07:35:46 BoogieIcfgContainer [2023-12-21 19:35:46,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 19:35:46,522 INFO L158 Benchmark]: Toolchain (without parser) took 871425.68ms. Allocated memory was 201.3MB in the beginning and 262.1MB in the end (delta: 60.8MB). Free memory was 156.7MB in the beginning and 224.3MB in the end (delta: -67.5MB). Peak memory consumption was 141.8MB. Max. memory is 8.0GB. [2023-12-21 19:35:46,522 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 158.2MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 19:35:46,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.27ms. Allocated memory is still 201.3MB. Free memory was 156.2MB in the beginning and 144.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 19:35:46,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.31ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 143.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 19:35:46,523 INFO L158 Benchmark]: Boogie Preprocessor took 43.70ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:35:46,523 INFO L158 Benchmark]: RCFGBuilder took 397.86ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 125.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 19:35:46,523 INFO L158 Benchmark]: TraceAbstraction took 870710.97ms. Allocated memory was 201.3MB in the beginning and 262.1MB in the end (delta: 60.8MB). Free memory was 124.8MB in the beginning and 224.3MB in the end (delta: -99.5MB). Peak memory consumption was 109.3MB. Max. memory is 8.0GB. [2023-12-21 19:35:46,542 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 158.2MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.27ms. Allocated memory is still 201.3MB. Free memory was 156.2MB in the beginning and 144.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.31ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 143.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.70ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 397.86ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 125.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 870710.97ms. Allocated memory was 201.3MB in the beginning and 262.1MB in the end (delta: 60.8MB). Free memory was 124.8MB in the beginning and 224.3MB in the end (delta: -99.5MB). Peak memory consumption was 109.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 33). Cancelled while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 74 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 89.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 164.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 144 ConstructedInterpolants, 67 QuantifiedInterpolants, 1450 SizeOfPredicates, 34 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 24/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown