/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/array9_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:47:15,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:47:15,393 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:47:15,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:47:15,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:47:15,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:47:15,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:47:15,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:47:15,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:47:15,423 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:47:15,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:47:15,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:47:15,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:47:15,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:47:15,425 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:47:15,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:47:15,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:47:15,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:47:15,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:47:15,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:47:15,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:47:15,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:47:15,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:47:15,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:47:15,427 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:47:15,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:47:15,427 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:47:15,428 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:47:15,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:47:15,428 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:47:15,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:47:15,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:47:15,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:47:15,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:47:15,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:47:15,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:47:15,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:47:15,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:47:15,430 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:47:15,430 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:47:15,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:47:15,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:47:15,430 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:47:15,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:47:15,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:47:15,431 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:47:15,431 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:47:15,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:47:15,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:47:15,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:47:15,665 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:47:15,665 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:47:15,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array9_pattern.c [2023-12-21 19:47:16,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:47:16,981 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:47:16,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array9_pattern.c [2023-12-21 19:47:16,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b076e732/11b0a608463a45828496d9b329ec4ec7/FLAG1fe775b2b [2023-12-21 19:47:17,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b076e732/11b0a608463a45828496d9b329ec4ec7 [2023-12-21 19:47:17,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:47:17,006 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:47:17,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:47:17,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:47:17,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:47:17,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4659efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17, skipping insertion in model container [2023-12-21 19:47:17,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,038 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:47:17,145 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/array9_pattern.c[1352,1365] [2023-12-21 19:47:17,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:47:17,180 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:47:17,189 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/array9_pattern.c[1352,1365] [2023-12-21 19:47:17,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:47:17,207 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:47:17,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17 WrapperNode [2023-12-21 19:47:17,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:47:17,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:47:17,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:47:17,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:47:17,214 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:47:17" (1/1) ... [2023-12-21 19:47:17,234 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:47:17" (1/1) ... [2023-12-21 19:47:17,251 INFO L138 Inliner]: procedures = 18, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-12-21 19:47:17,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:47:17,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:47:17,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:47:17,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:47:17,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,280 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 3, 4]. 44 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:47:17,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:47:17,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:47:17,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:47:17,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:47:17,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (1/1) ... [2023-12-21 19:47:17,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:47:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:47:17,350 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:47:17,398 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:47:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:47:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:47:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:47:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 19:47:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 19:47:17,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 19:47:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:47:17,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:47:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 19:47:17,489 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:47:17,491 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:47:17,690 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:47:17,718 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:47:17,719 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 19:47:17,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:47:17 BoogieIcfgContainer [2023-12-21 19:47:17,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:47:17,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:47:17,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:47:17,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:47:17,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:47:17" (1/3) ... [2023-12-21 19:47:17,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b7c563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:47:17, skipping insertion in model container [2023-12-21 19:47:17,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:47:17" (2/3) ... [2023-12-21 19:47:17,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b7c563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:47:17, skipping insertion in model container [2023-12-21 19:47:17,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:47:17" (3/3) ... [2023-12-21 19:47:17,725 INFO L112 eAbstractionObserver]: Analyzing ICFG array9_pattern.c [2023-12-21 19:47:17,737 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:47:17,737 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:47:17,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:47:17,775 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;@10e0d078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:47:17,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:47:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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:47:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 19:47:17,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:17,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:47:17,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:17,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash 653365123, now seen corresponding path program 1 times [2023-12-21 19:47:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:17,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338051161] [2023-12-21 19:47:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:47:17,796 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:47:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:17,798 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:47:17,799 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:47:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:47:17,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 19:47:17,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:17,912 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:47:17,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:47:17,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338051161] [2023-12-21 19:47:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338051161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:47:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:47:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:47:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226084415] [2023-12-21 19:47:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:47:17,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 19:47:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:17,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 19:47:17,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:47:17,945 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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.5) internal successors, (13), 2 states have internal predecessors, (13), 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:47:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:47:17,992 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2023-12-21 19:47:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 19:47:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 15 [2023-12-21 19:47:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:47:17,998 INFO L225 Difference]: With dead ends: 44 [2023-12-21 19:47:17,998 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 19:47:18,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:47:18,006 INFO L413 NwaCegarLoop]: 23 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, 23 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:47:18,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:47:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 19:47:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 19:47:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:47:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 19:47:18,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-12-21 19:47:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:47:18,036 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 19:47:18,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:47:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 19:47:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 19:47:18,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:18,038 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, 1] [2023-12-21 19:47:18,043 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:47:18,240 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:47:18,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:18,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -610736530, now seen corresponding path program 1 times [2023-12-21 19:47:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595188666] [2023-12-21 19:47:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:47:18,242 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:47:18,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:18,244 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:47:18,254 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:47:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:47:18,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 19:47:18,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:47:18,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:47:18,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595188666] [2023-12-21 19:47:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595188666] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:47:18,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:47:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 19:47:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427781360] [2023-12-21 19:47:18,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:47:18,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 19:47:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 19:47:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-21 19:47:18,926 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:47:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:47:19,175 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-12-21 19:47:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 19:47:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 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:47:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:47:19,177 INFO L225 Difference]: With dead ends: 30 [2023-12-21 19:47:19,177 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 19:47:19,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-21 19:47:19,178 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:47:19,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 82 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:47:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 19:47:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 19:47:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:47:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-21 19:47:19,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2023-12-21 19:47:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:47:19,184 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-21 19:47:19,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 19:47:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-21 19:47:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 19:47:19,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:19,185 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, 1, 1] [2023-12-21 19:47:19,188 INFO L552 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)] Ended with exit code 0 [2023-12-21 19:47:19,385 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:47:19,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:19,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1728269380, now seen corresponding path program 1 times [2023-12-21 19:47:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:19,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071403176] [2023-12-21 19:47:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:47:19,390 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:47:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:19,392 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:47:19,394 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:47:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:47:19,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:47:19,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:19,568 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:47:19,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:47:19,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071403176] [2023-12-21 19:47:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071403176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:47:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:47:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:47:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852201040] [2023-12-21 19:47:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:47:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:47:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:47:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:47:19,573 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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:47:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:47:19,795 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-12-21 19:47:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:47:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2023-12-21 19:47:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:47:19,797 INFO L225 Difference]: With dead ends: 45 [2023-12-21 19:47:19,797 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 19:47:19,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:47:19,798 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:47:19,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 50 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:47:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 19:47:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 19:47:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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:47:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-21 19:47:19,803 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2023-12-21 19:47:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:47:19,803 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-21 19:47:19,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 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:47:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-21 19:47:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 19:47:19,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:19,804 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, 1, 1, 1] [2023-12-21 19:47:19,808 INFO L552 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)] Ended with exit code 0 [2023-12-21 19:47:20,009 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:47:20,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:20,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1384241075, now seen corresponding path program 1 times [2023-12-21 19:47:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098184198] [2023-12-21 19:47:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:47:20,010 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:47:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:20,016 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:47:20,032 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:47:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:47:20,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-21 19:47:20,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:20,292 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:47:20,752 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 14 treesize of output 10 [2023-12-21 19:47:21,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:47:21,166 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-12-21 19:47:21,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 34 [2023-12-21 19:47:21,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:47:21,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:47:21,449 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 22 treesize of output 14 [2023-12-21 19:47:21,552 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:47:21,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:22,594 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 35 treesize of output 33 [2023-12-21 19:47:22,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2023-12-21 19:47:26,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:26,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098184198] [2023-12-21 19:47:26,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098184198] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:47:26,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [360756502] [2023-12-21 19:47:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:47:26,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:47:26,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:47:26,157 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:47:26,159 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:47:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:47:26,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 19:47:26,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:26,459 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:47:26,708 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 14 treesize of output 10 [2023-12-21 19:47:26,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:47:26,810 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-12-21 19:47:26,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 34 [2023-12-21 19:47:26,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:47:26,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:47:26,934 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 22 treesize of output 14 [2023-12-21 19:47:26,993 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:47:26,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:27,394 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 35 treesize of output 33 [2023-12-21 19:47:27,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2023-12-21 19:47:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [360756502] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:47:29,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:47:29,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 20 [2023-12-21 19:47:29,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412198442] [2023-12-21 19:47:29,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:47:29,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 19:47:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 19:47:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2023-12-21 19:47:29,183 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 17 states have internal predecessors, (27), 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:47:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:47:31,346 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-12-21 19:47:31,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 19:47:31,350 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 17 states have internal predecessors, (27), 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 26 [2023-12-21 19:47:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:47:31,350 INFO L225 Difference]: With dead ends: 69 [2023-12-21 19:47:31,350 INFO L226 Difference]: Without dead ends: 50 [2023-12-21 19:47:31,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 19:47:31,352 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 19:47:31,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 137 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 19:47:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-21 19:47:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2023-12-21 19:47:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:47:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-12-21 19:47:31,363 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2023-12-21 19:47:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:47:31,364 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-12-21 19:47:31,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 17 states have internal predecessors, (27), 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:47:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-12-21 19:47:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 19:47:31,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:31,367 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, 1, 1, 1] [2023-12-21 19:47:31,371 INFO L552 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)] Ended with exit code 0 [2023-12-21 19:47:31,573 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:47:31,773 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:47:31,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:31,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -13505769, now seen corresponding path program 2 times [2023-12-21 19:47:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139704158] [2023-12-21 19:47:31,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:47:31,775 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:47:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:31,779 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:47:31,783 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:47:31,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:47:31,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:47:31,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 19:47:31,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:47:32,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:47:32,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139704158] [2023-12-21 19:47:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139704158] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:47:32,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:47:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-12-21 19:47:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182167002] [2023-12-21 19:47:32,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:47:32,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 19:47:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 19:47:32,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-12-21 19:47:32,435 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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:47:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:47:32,959 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-12-21 19:47:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 19:47:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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 27 [2023-12-21 19:47:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:47:32,961 INFO L225 Difference]: With dead ends: 52 [2023-12-21 19:47:32,961 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 19:47:32,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2023-12-21 19:47:32,962 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 97 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:47:32,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 88 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:47:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 19:47:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-12-21 19:47:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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:47:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-21 19:47:32,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 27 [2023-12-21 19:47:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:47:32,969 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-21 19:47:32,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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:47:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-21 19:47:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 19:47:32,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:32,970 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, 1, 1, 1] [2023-12-21 19:47:32,973 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:47:33,173 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:47:33,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -912182628, now seen corresponding path program 3 times [2023-12-21 19:47:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980211255] [2023-12-21 19:47:33,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:47:33,175 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:47:33,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:33,176 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:47:33,180 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:47:33,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 19:47:33,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:47:33,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:47:33,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:33,471 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:47:33,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:33,642 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:47:33,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:33,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980211255] [2023-12-21 19:47:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980211255] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:47:33,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:47:33,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:47:33,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236061177] [2023-12-21 19:47:33,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:47:33,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:47:33,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:33,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:47:33,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:47:33,644 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 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:47:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:47:34,009 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2023-12-21 19:47:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 19:47:34,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 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 27 [2023-12-21 19:47:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:47:34,010 INFO L225 Difference]: With dead ends: 33 [2023-12-21 19:47:34,010 INFO L226 Difference]: Without dead ends: 29 [2023-12-21 19:47:34,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-12-21 19:47:34,011 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 57 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:47:34,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 69 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:47:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-21 19:47:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-21 19:47:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:47:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-21 19:47:34,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 27 [2023-12-21 19:47:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:47:34,017 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-21 19:47:34,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 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:47:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-21 19:47:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 19:47:34,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:47:34,018 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, 1, 1, 1] [2023-12-21 19:47:34,026 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:47:34,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:47:34,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:47:34,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:47:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1811803470, now seen corresponding path program 4 times [2023-12-21 19:47:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:47:34,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910295015] [2023-12-21 19:47:34,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:47:34,223 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:47:34,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:47:34,224 INFO L229 MonitoredProcess]: Starting monitored process 9 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:47:34,225 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 (9)] Waiting until timeout for monitored process [2023-12-21 19:47:34,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:47:34,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:47:34,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 19:47:34,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:34,474 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:47:34,545 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:47:34,584 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:47:35,333 INFO L349 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2023-12-21 19:47:35,334 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 3 case distinctions, treesize of input 29 treesize of output 42 [2023-12-21 19:47:36,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:47:36,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:47:36,054 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-12-21 19:47:36,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 54 [2023-12-21 19:47:36,634 INFO L349 Elim1Store]: treesize reduction 12, result has 47.8 percent of original size [2023-12-21 19:47:36,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 26 [2023-12-21 19:47:36,789 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:47:36,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:47,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:47:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910295015] [2023-12-21 19:47:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910295015] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:47:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [330494739] [2023-12-21 19:47:47,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:47:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:47:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:47:47,515 INFO L229 MonitoredProcess]: Starting monitored process 10 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:47:47,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-21 19:47:47,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:47:47,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:47:47,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 19:47:47,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:47:48,157 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:47:48,230 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:47:48,240 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:47:48,697 INFO L349 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2023-12-21 19:47:48,698 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 3 case distinctions, treesize of input 29 treesize of output 42 [2023-12-21 19:47:49,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:47:49,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:47:49,218 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-12-21 19:47:49,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 54 [2023-12-21 19:47:49,552 INFO L349 Elim1Store]: treesize reduction 12, result has 47.8 percent of original size [2023-12-21 19:47:49,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 26 [2023-12-21 19:47:49,635 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:47:49,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:47:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [330494739] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:47:51,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:47:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 22 [2023-12-21 19:47:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326880243] [2023-12-21 19:47:51,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:47:51,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 19:47:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:47:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 19:47:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2023-12-21 19:47:51,013 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 19 states have internal predecessors, (29), 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:47:57,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:48:04,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:48:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:48:04,161 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-12-21 19:48:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 19:48:04,166 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 19 states have internal predecessors, (29), 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 28 [2023-12-21 19:48:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:48:04,167 INFO L225 Difference]: With dead ends: 58 [2023-12-21 19:48:04,167 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 19:48:04,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=308, Invalid=1672, Unknown=0, NotChecked=0, Total=1980 [2023-12-21 19:48:04,169 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-21 19:48:04,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 203 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2023-12-21 19:48:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 19:48:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2023-12-21 19:48:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:48:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-12-21 19:48:04,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 28 [2023-12-21 19:48:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:48:04,177 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-12-21 19:48:04,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 19 states have internal predecessors, (29), 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:48:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-12-21 19:48:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 19:48:04,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:48:04,177 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, 1, 1, 1] [2023-12-21 19:48:04,182 INFO L552 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 (9)] Ended with exit code 0 [2023-12-21 19:48:04,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-21 19:48:04,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:48:04,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:48:04,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:48:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1418776460, now seen corresponding path program 1 times [2023-12-21 19:48:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:48:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417313587] [2023-12-21 19:48:04,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:48:04,587 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:48:04,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:48:04,588 INFO L229 MonitoredProcess]: Starting monitored process 11 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:48:04,589 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 (11)] Waiting until timeout for monitored process [2023-12-21 19:48:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:48:04,755 WARN L260 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 19:48:04,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:48:04,874 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:48:04,888 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:48:04,968 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 23 treesize of output 11 [2023-12-21 19:48:04,989 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 23 treesize of output 11 [2023-12-21 19:48:05,678 INFO L349 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2023-12-21 19:48:05,678 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 3 case distinctions, treesize of input 29 treesize of output 42 [2023-12-21 19:48:07,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:48:07,172 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 19:48:07,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2023-12-21 19:48:07,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:48:07,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:48:07,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2023-12-21 19:48:07,858 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2023-12-21 19:48:07,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 33 [2023-12-21 19:48:08,021 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:48:08,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:48:23,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:48:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417313587] [2023-12-21 19:48:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417313587] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:48:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1772595965] [2023-12-21 19:48:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:48:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:48:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:48:23,426 INFO L229 MonitoredProcess]: Starting monitored process 12 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:48:23,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-21 19:48:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:48:23,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 19:48:23,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:48:24,110 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:48:24,121 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:48:24,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 19:48:24,176 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 23 treesize of output 11 [2023-12-21 19:48:24,502 INFO L349 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2023-12-21 19:48:24,502 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 3 case distinctions, treesize of input 29 treesize of output 42 [2023-12-21 19:48:24,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:48:24,886 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 19:48:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2023-12-21 19:48:25,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:48:25,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:48:25,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2023-12-21 19:48:25,135 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2023-12-21 19:48:25,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 33 [2023-12-21 19:48:25,196 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:48:25,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:48:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1772595965] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:48:26,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:48:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 22 [2023-12-21 19:48:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033378689] [2023-12-21 19:48:26,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:48:26,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 19:48:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:48:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 19:48:26,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2023-12-21 19:48:26,689 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 19 states have internal predecessors, (29), 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:48:33,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:48:39,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:48:43,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:48:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:48:43,597 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2023-12-21 19:48:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 19:48:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 19 states have internal predecessors, (29), 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 28 [2023-12-21 19:48:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:48:43,607 INFO L225 Difference]: With dead ends: 82 [2023-12-21 19:48:43,607 INFO L226 Difference]: Without dead ends: 71 [2023-12-21 19:48:43,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=318, Invalid=1574, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 19:48:43,608 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:48:43,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 323 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2023-12-21 19:48:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-21 19:48:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2023-12-21 19:48:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 19:48:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-12-21 19:48:43,619 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 28 [2023-12-21 19:48:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:48:43,619 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-12-21 19:48:43,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 19 states have internal predecessors, (29), 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:48:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-12-21 19:48:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 19:48:43,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:48:43,620 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:48:43,626 INFO L552 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 (11)] Ended with exit code 0 [2023-12-21 19:48:43,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-21 19:48:44,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:48:44,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:48:44,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:48:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash 356026588, now seen corresponding path program 5 times [2023-12-21 19:48:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:48:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259663638] [2023-12-21 19:48:44,029 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 19:48:44,029 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:48:44,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:48:44,030 INFO L229 MonitoredProcess]: Starting monitored process 13 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:48:44,052 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 (13)] Waiting until timeout for monitored process [2023-12-21 19:48:44,138 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 19:48:44,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:48:44,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 19:48:44,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:48:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:48:44,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:48:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:48:44,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:48:44,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259663638] [2023-12-21 19:48:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259663638] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:48:44,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:48:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-21 19:48:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846514733] [2023-12-21 19:48:44,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:48:44,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 19:48:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:48:44,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 19:48:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-21 19:48:44,709 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:48:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:48:45,477 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2023-12-21 19:48:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 19:48:45,477 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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 29 [2023-12-21 19:48:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:48:45,478 INFO L225 Difference]: With dead ends: 87 [2023-12-21 19:48:45,478 INFO L226 Difference]: Without dead ends: 78 [2023-12-21 19:48:45,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-21 19:48:45,479 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 19:48:45,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 113 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 19:48:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-21 19:48:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-12-21 19:48:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 19:48:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-12-21 19:48:45,498 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 29 [2023-12-21 19:48:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:48:45,498 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-12-21 19:48:45,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:48:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-12-21 19:48:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 19:48:45,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:48:45,501 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:48:45,522 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 (13)] Forceful destruction successful, exit code 0 [2023-12-21 19:48:45,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:48:45,706 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:48:45,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:48:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1733152265, now seen corresponding path program 6 times [2023-12-21 19:48:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:48:45,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208805167] [2023-12-21 19:48:45,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 19:48:45,707 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:48:45,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:48:45,708 INFO L229 MonitoredProcess]: Starting monitored process 14 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:48:45,730 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 (14)] Waiting until timeout for monitored process [2023-12-21 19:48:45,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-21 19:48:45,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:48:45,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 19:48:45,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:48:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:48:46,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:48:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:48:46,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:48:46,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208805167] [2023-12-21 19:48:46,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208805167] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:48:46,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:48:46,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-12-21 19:48:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65597386] [2023-12-21 19:48:46,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:48:46,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 19:48:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:48:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 19:48:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-12-21 19:48:46,537 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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:48:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:48:47,569 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-12-21 19:48:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 19:48:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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 29 [2023-12-21 19:48:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:48:47,571 INFO L225 Difference]: With dead ends: 82 [2023-12-21 19:48:47,571 INFO L226 Difference]: Without dead ends: 78 [2023-12-21 19:48:47,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2023-12-21 19:48:47,572 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 132 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 19:48:47,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 165 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 19:48:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-21 19:48:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2023-12-21 19:48:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 19:48:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-12-21 19:48:47,585 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 29 [2023-12-21 19:48:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:48:47,585 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-12-21 19:48:47,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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:48:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-12-21 19:48:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 19:48:47,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:48:47,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:48:47,590 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 (14)] Forceful destruction successful, exit code 0 [2023-12-21 19:48:47,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:48:47,790 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:48:47,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:48:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2131548499, now seen corresponding path program 7 times [2023-12-21 19:48:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:48:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820259286] [2023-12-21 19:48:47,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 19:48:47,791 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:48:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:48:47,792 INFO L229 MonitoredProcess]: Starting monitored process 15 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:48:47,794 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 (15)] Waiting until timeout for monitored process [2023-12-21 19:48:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:48:47,974 WARN L260 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-21 19:48:47,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:48:48,158 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:48:48,237 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:48:48,259 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:48:48,370 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:48:48,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:48:48,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:48:49,480 INFO L349 Elim1Store]: treesize reduction 98, result has 34.2 percent of original size [2023-12-21 19:48:49,481 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 43 treesize of output 73 [2023-12-21 19:48:50,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:48:50,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:48:50,385 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:48:50,405 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-12-21 19:48:50,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 64 treesize of output 74 [2023-12-21 19:48:51,646 INFO L349 Elim1Store]: treesize reduction 16, result has 52.9 percent of original size [2023-12-21 19:48:51,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2023-12-21 19:48:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:48:51,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:49:10,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:49:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820259286] [2023-12-21 19:49:10,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820259286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:49:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945965229] [2023-12-21 19:49:10,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 19:49:10,691 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:49:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:49:10,692 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:10,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-21 19:49:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:49:11,326 WARN L260 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-21 19:49:11,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:49:11,759 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:49:11,804 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:49:11,820 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:49:11,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:49:11,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:49:11,888 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:49:15,864 INFO L349 Elim1Store]: treesize reduction 98, result has 34.2 percent of original size [2023-12-21 19:49:15,864 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 43 treesize of output 73 [2023-12-21 19:49:17,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:49:17,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:49:17,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:49:17,632 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-12-21 19:49:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 64 treesize of output 74 [2023-12-21 19:49:20,083 INFO L349 Elim1Store]: treesize reduction 16, result has 52.9 percent of original size [2023-12-21 19:49:20,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2023-12-21 19:49:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:49:21,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:49:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1945965229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:49:56,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:49:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 39 [2023-12-21 19:49:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151730737] [2023-12-21 19:49:56,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:49:56,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-21 19:49:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:49:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-21 19:49:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3000, Unknown=0, NotChecked=0, Total=3422 [2023-12-21 19:49:56,103 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:50:05,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:50:09,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:50:12,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:50:19,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:50:23,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:50:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:50:24,042 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2023-12-21 19:50:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 19:50:24,049 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.2) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-12-21 19:50:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:50:24,050 INFO L225 Difference]: With dead ends: 104 [2023-12-21 19:50:24,050 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 19:50:24,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=679, Invalid=4433, Unknown=0, NotChecked=0, Total=5112 [2023-12-21 19:50:24,052 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 59 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-12-21 19:50:24,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 630 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2023-12-21 19:50:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 19:50:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2023-12-21 19:50:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-21 19:50:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2023-12-21 19:50:24,067 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 30 [2023-12-21 19:50:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:50:24,077 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2023-12-21 19:50:24,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.2) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:50:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2023-12-21 19:50:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 19:50:24,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:50:24,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:50:24,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-12-21 19:50:24,290 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 (15)] Forceful destruction successful, exit code 0 [2023-12-21 19:50:24,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /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:50:24,484 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:50:24,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:50:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1462354219, now seen corresponding path program 2 times [2023-12-21 19:50:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:50:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17269353] [2023-12-21 19:50:24,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:50:24,485 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:50:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:50:24,486 INFO L229 MonitoredProcess]: Starting monitored process 17 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:50:24,511 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 (17)] Waiting until timeout for monitored process [2023-12-21 19:50:24,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:50:24,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:50:24,680 WARN L260 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 19:50:24,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:50:24,820 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:50:24,831 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:50:24,908 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:50:24,931 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:50:25,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:50:25,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:50:25,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:50:25,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:50:26,264 INFO L349 Elim1Store]: treesize reduction 147, result has 34.1 percent of original size [2023-12-21 19:50:26,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 57 treesize of output 104 [2023-12-21 19:50:28,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:50:28,437 INFO L349 Elim1Store]: treesize reduction 114, result has 30.9 percent of original size [2023-12-21 19:50:28,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 57 treesize of output 95 [2023-12-21 19:50:33,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:50:33,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 188 treesize of output 284 [2023-12-21 19:50:34,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:50:34,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 239 [2023-12-21 19:50:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:50:50,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:51:24,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:51:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17269353] [2023-12-21 19:51:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17269353] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:51:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [198896348] [2023-12-21 19:51:24,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:51:24,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:51:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:51:24,132 INFO L229 MonitoredProcess]: Starting monitored process 18 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:51:24,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-21 19:51:24,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:51:24,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:51:24,954 WARN L260 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-21 19:51:24,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:51:25,533 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:51:25,547 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:51:25,603 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:51:25,616 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:51:25,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:51:25,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:51:25,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:51:25,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:51:28,473 INFO L349 Elim1Store]: treesize reduction 45, result has 48.9 percent of original size [2023-12-21 19:51:28,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 62 [2023-12-21 19:51:32,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:51:32,322 INFO L349 Elim1Store]: treesize reduction 34, result has 46.0 percent of original size [2023-12-21 19:51:32,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 57 [2023-12-21 19:51:41,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:51:41,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 179 treesize of output 275 [2023-12-21 19:51:42,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:51:42,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 230 [2023-12-21 19:51:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:51:52,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [198896348] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:52:48,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 34 [2023-12-21 19:52:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017922093] [2023-12-21 19:52:48,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:48,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-21 19:52:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-21 19:52:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=2365, Unknown=2, NotChecked=0, Total=2756 [2023-12-21 19:52:48,213 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 31 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:53:00,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:04,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:09,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:17,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:37,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:41,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:45,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:49,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:53,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:53:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:53:53,962 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2023-12-21 19:53:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-21 19:53:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 31 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-12-21 19:53:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:53:53,988 INFO L225 Difference]: With dead ends: 139 [2023-12-21 19:53:53,988 INFO L226 Difference]: Without dead ends: 127 [2023-12-21 19:53:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 127.7s TimeCoverageRelationStatistics Valid=707, Invalid=4403, Unknown=2, NotChecked=0, Total=5112 [2023-12-21 19:53:53,989 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 81 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 28 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:53:53,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 417 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 904 Invalid, 9 Unknown, 0 Unchecked, 42.3s Time] [2023-12-21 19:53:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-21 19:53:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2023-12-21 19:53:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 89 states have internal predecessors, (104), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 19:53:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2023-12-21 19:53:54,020 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 30 [2023-12-21 19:53:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:53:54,020 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2023-12-21 19:53:54,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 31 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:53:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2023-12-21 19:53:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 19:53:54,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:53:54,024 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:53:54,029 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 (17)] Forceful destruction successful, exit code 0 [2023-12-21 19:53:54,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-12-21 19:53:54,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:53:54,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:53:54,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:53:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1338152892, now seen corresponding path program 8 times [2023-12-21 19:53:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:53:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428349919] [2023-12-21 19:53:54,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:53:54,429 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:53:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:53:54,430 INFO L229 MonitoredProcess]: Starting monitored process 19 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:53:54,441 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 (19)] Waiting until timeout for monitored process [2023-12-21 19:53:54,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:53:54,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:53:54,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 19:53:54,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:53:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:53:54,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:53:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:53:55,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:53:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428349919] [2023-12-21 19:53:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428349919] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:53:55,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:53:55,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2023-12-21 19:53:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649647693] [2023-12-21 19:53:55,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:53:55,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 19:53:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:53:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 19:53:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2023-12-21 19:53:55,690 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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:53:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:53:57,663 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2023-12-21 19:53:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 19:53:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 31 [2023-12-21 19:53:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:53:57,665 INFO L225 Difference]: With dead ends: 139 [2023-12-21 19:53:57,665 INFO L226 Difference]: Without dead ends: 135 [2023-12-21 19:53:57,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 19:53:57,666 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 115 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-21 19:53:57,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 295 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-21 19:53:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-21 19:53:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2023-12-21 19:53:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 89 states have internal predecessors, (104), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 19:53:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2023-12-21 19:53:57,700 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 31 [2023-12-21 19:53:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:53:57,700 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2023-12-21 19:53:57,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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:53:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2023-12-21 19:53:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 19:53:57,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:53:57,701 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:53:57,705 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 (19)] Forceful destruction successful, exit code 0 [2023-12-21 19:53:57,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:53:57,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:53:57,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:53:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1442239442, now seen corresponding path program 9 times [2023-12-21 19:53:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:53:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323919441] [2023-12-21 19:53:57,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:53:57,906 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:53:57,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:53:57,907 INFO L229 MonitoredProcess]: Starting monitored process 20 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:53:57,939 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 (20)] Waiting until timeout for monitored process [2023-12-21 19:53:58,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 19:53:58,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:53:58,175 WARN L260 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-21 19:53:58,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:53:58,332 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:53:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 19:53:58,429 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:53:58,443 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:53:58,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:53:58,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:53:58,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:53:58,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:53:58,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:53:58,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-21 19:53:58,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:53:58,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-21 19:54:00,205 INFO L349 Elim1Store]: treesize reduction 196, result has 34.0 percent of original size [2023-12-21 19:54:00,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 71 treesize of output 135 [2023-12-21 19:54:02,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:54:02,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:54:02,834 INFO L349 Elim1Store]: treesize reduction 188, result has 13.4 percent of original size [2023-12-21 19:54:02,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 78 treesize of output 91 [2023-12-21 19:54:11,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:54:11,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 128 treesize of output 253 [2023-12-21 19:54:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:54:24,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:55:12,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:55:12,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323919441] [2023-12-21 19:55:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323919441] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:55:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191150343] [2023-12-21 19:55:12,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:55:12,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:55:12,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:55:12,952 INFO L229 MonitoredProcess]: Starting monitored process 21 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:55:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-21 19:55:14,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 19:55:14,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:55:14,395 WARN L260 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-21 19:55:14,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:55:15,458 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:55:15,468 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:55:16,338 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:55:16,355 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:55:17,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:55:17,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:55:17,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:55:17,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:55:18,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:55:18,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-21 19:55:18,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:55:18,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-21 19:55:25,788 INFO L349 Elim1Store]: treesize reduction 196, result has 34.0 percent of original size [2023-12-21 19:55:25,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 71 treesize of output 135 [2023-12-21 19:55:26,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:55:26,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:55:27,168 INFO L349 Elim1Store]: treesize reduction 188, result has 13.4 percent of original size [2023-12-21 19:55:27,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 78 treesize of output 91 [2023-12-21 19:55:30,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:55:30,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 128 treesize of output 253 [2023-12-21 19:56:30,929 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_50| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_50|) c_~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv3 32)) c_~ARR_SIZE~0) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (let ((.cse84 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse3 (= (bvmul (_ bv8 64) .cse84) |c_ULTIMATE.start_main_~sum~0#1|))) (or (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse0 ((_ sign_extend 16) v_prenex_12))) (let ((.cse1 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse2 (bvmul (_ bv4 32) .cse0))) (and (= (bvsrem .cse0 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse1)) (not (= (_ bv4 32) .cse1)) (not (= .cse2 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse0) c_~ARR_SIZE~0) (not (= .cse1 .cse2)) (bvsge .cse0 (_ bv0 32)) (not (= .cse2 (_ bv12 32))) (not (= .cse2 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse4 ((_ sign_extend 16) v_prenex_12))) (let ((.cse5 (bvmul (_ bv4 32) .cse4)) (.cse7 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse6 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse4 (_ bv3 32)) (_ bv0 32)) (not (= .cse5 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse4) c_~ARR_SIZE~0) (not (= .cse6 .cse5)) (bvsge .cse4 (_ bv0 32)) (not (= .cse5 (_ bv12 32))) (not (= .cse5 .cse7)) (not (= .cse6 .cse7)) (not (= .cse6 (_ bv0 32))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse10 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse11 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) v_prenex_12))) (let ((.cse9 (bvmul (_ bv4 32) .cse8))) (and (= (bvsrem .cse8 (_ bv3 32)) (_ bv0 32)) (not (= .cse9 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse8) c_~ARR_SIZE~0) (not (= .cse10 .cse9)) (bvsge .cse8 (_ bv0 32)) (not (= .cse9 (_ bv12 32))) (not (= .cse9 .cse11)))))) (not (= .cse10 .cse11)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse12 ((_ sign_extend 16) v_prenex_12))) (let ((.cse14 (bvmul (_ bv4 32) .cse12)) (.cse13 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse15 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse12 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse13)) (not (= (_ bv4 32) .cse13)) (not (= .cse14 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse12) c_~ARR_SIZE~0) (not (= .cse13 .cse14)) (bvsge .cse12 (_ bv0 32)) (not (= .cse14 (_ bv12 32))) (not (= .cse14 .cse15)) (not (= .cse13 .cse15)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse16 ((_ sign_extend 16) v_prenex_12))) (let ((.cse18 (bvmul (_ bv4 32) .cse16)) (.cse17 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse19 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse16 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse17)) (not (= .cse18 (_ bv0 32))) (not (= .cse19 (_ bv0 32))) (not (= .cse17 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse16) c_~ARR_SIZE~0) (not (= .cse19 (_ bv12 32))) (not (= .cse17 .cse18)) (bvsge .cse16 (_ bv0 32)) (not (= .cse18 (_ bv12 32))) (not (= (_ bv4 32) .cse19)) (not (= (_ bv8 32) .cse19)) (not (= .cse17 .cse19)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) v_prenex_12))) (let ((.cse22 (bvmul (_ bv4 32) .cse20)) (.cse23 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse21 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse20 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse21)) (not (= (_ bv4 32) .cse21)) (not (= .cse22 (_ bv0 32))) (not (= .cse23 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse20) c_~ARR_SIZE~0) (not (= .cse23 (_ bv12 32))) (not (= .cse21 .cse22)) (bvsge .cse20 (_ bv0 32)) (not (= .cse22 (_ bv12 32))) (not (= (_ bv4 32) .cse23)) (not (= (_ bv8 32) .cse23)) (not (= .cse21 .cse23)) (not (= .cse21 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse24 ((_ sign_extend 16) v_prenex_12))) (let ((.cse25 (bvmul (_ bv4 32) .cse24)) (.cse26 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse27 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse24 (_ bv3 32)) (_ bv0 32)) (not (= .cse25 (_ bv0 32))) (not (= .cse26 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse24) c_~ARR_SIZE~0) (not (= .cse27 .cse25)) (bvsge .cse24 (_ bv0 32)) (not (= .cse25 (_ bv12 32))) (not (= .cse25 .cse26)) (not (= .cse27 .cse26)) (not (= .cse27 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 16) v_prenex_12))) (let ((.cse30 (bvmul (_ bv4 32) .cse28)) (.cse31 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse29 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse28 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse29)) (not (= .cse30 (_ bv0 32))) (not (= .cse31 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse28) c_~ARR_SIZE~0) (not (= .cse29 .cse30)) (bvsge .cse28 (_ bv0 32)) (not (= .cse30 (_ bv12 32))) (not (= .cse30 .cse31)) (not (= .cse29 (_ bv0 32))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse35 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) v_prenex_12))) (let ((.cse33 (bvmul (_ bv4 32) .cse32)) (.cse34 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse32 (_ bv3 32)) (_ bv0 32)) (not (= .cse33 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse32) c_~ARR_SIZE~0) (not (= .cse34 .cse33)) (bvsge .cse32 (_ bv0 32)) (not (= .cse33 (_ bv12 32))) (not (= .cse33 .cse35)) (not (= .cse34 .cse35)))))) (not (= (_ bv8 32) .cse35))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse36 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= (_ bv8 32) .cse36)) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse37 ((_ sign_extend 16) v_prenex_12))) (let ((.cse38 (bvmul (_ bv4 32) .cse37)) (.cse39 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse37 (_ bv3 32)) (_ bv0 32)) (not (= .cse38 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse37) c_~ARR_SIZE~0) (not (= .cse39 .cse38)) (bvsge .cse37 (_ bv0 32)) (not (= .cse38 (_ bv12 32))) (not (= .cse38 .cse36)) (not (= .cse39 .cse36)) (not (= .cse39 (_ bv0 32))))))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse40 ((_ sign_extend 16) v_prenex_12))) (let ((.cse42 (bvmul (_ bv4 32) .cse40)) (.cse41 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse40 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse41)) (not (= .cse42 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse40) c_~ARR_SIZE~0) (not (= .cse41 .cse42)) (bvsge .cse40 (_ bv0 32)) (not (= .cse42 (_ bv12 32))) (not (= .cse42 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (not (= .cse41 (_ bv0 32))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse45 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 16) v_prenex_12))) (let ((.cse44 (bvmul (_ bv4 32) .cse43))) (and (= (bvsrem .cse43 (_ bv3 32)) (_ bv0 32)) (not (= .cse44 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse43) c_~ARR_SIZE~0) (not (= .cse45 .cse44)) (bvsge .cse43 (_ bv0 32)) (not (= .cse44 (_ bv12 32))) (not (= .cse44 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) (not (= (_ bv4 32) .cse45)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse46 ((_ sign_extend 16) v_prenex_12))) (let ((.cse48 (bvmul (_ bv4 32) .cse46)) (.cse49 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse47 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse46 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse47)) (not (= (_ bv4 32) .cse47)) (not (= .cse48 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse46) c_~ARR_SIZE~0) (not (= .cse47 .cse48)) (bvsge .cse46 (_ bv0 32)) (not (= .cse48 (_ bv12 32))) (not (= .cse48 .cse49)) (not (= .cse47 .cse49)) (not (= .cse47 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse50 ((_ sign_extend 16) v_prenex_12))) (let ((.cse52 (bvmul (_ bv4 32) .cse50)) (.cse51 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse53 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse50 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse51)) (not (= (_ bv4 32) .cse51)) (not (= .cse52 (_ bv0 32))) (not (= .cse53 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse50) c_~ARR_SIZE~0) (not (= .cse51 .cse52)) (bvsge .cse50 (_ bv0 32)) (not (= .cse52 (_ bv12 32))) (not (= .cse52 .cse53)) (not (= .cse51 .cse53)))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse54 ((_ sign_extend 16) v_prenex_12))) (let ((.cse55 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse56 (bvmul (_ bv4 32) .cse54)) (.cse57 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse54 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse55)) (not (= .cse56 (_ bv0 32))) (not (= .cse57 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse54) c_~ARR_SIZE~0) (not (= .cse55 .cse56)) (bvsge .cse54 (_ bv0 32)) (not (= .cse56 (_ bv12 32))) (not (= .cse56 .cse57))))))) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse58 ((_ sign_extend 16) v_prenex_12))) (let ((.cse59 (bvmul (_ bv4 32) .cse58)) (.cse61 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse60 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse58 (_ bv3 32)) (_ bv0 32)) (not (= .cse59 (_ bv0 32))) (not (= .cse60 (_ bv0 32))) (not (= .cse61 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse58) c_~ARR_SIZE~0) (not (= .cse60 (_ bv12 32))) (not (= .cse61 .cse59)) (bvsge .cse58 (_ bv0 32)) (not (= .cse59 (_ bv12 32))) (not (= (_ bv4 32) .cse60)) (not (= (_ bv8 32) .cse60)) (not (= .cse61 .cse60)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse62 ((_ sign_extend 16) v_prenex_12))) (let ((.cse63 (bvmul (_ bv4 32) .cse62)) (.cse64 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse65 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse62 (_ bv3 32)) (_ bv0 32)) (not (= .cse63 (_ bv0 32))) (not (= .cse64 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse62) c_~ARR_SIZE~0) (not (= .cse64 .cse63)) (bvsge .cse62 (_ bv0 32)) (not (= .cse63 (_ bv12 32))) (not (= .cse63 .cse65)) (not (= .cse64 .cse65)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse66 ((_ sign_extend 16) v_prenex_12))) (let ((.cse67 (bvmul (_ bv4 32) .cse66)) (.cse68 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse69 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse66 (_ bv3 32)) (_ bv0 32)) (not (= .cse67 (_ bv0 32))) (not (= .cse68 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse66) c_~ARR_SIZE~0) (not (= .cse69 .cse67)) (bvsge .cse66 (_ bv0 32)) (not (= .cse67 (_ bv12 32))) (not (= (_ bv8 32) .cse68)) (not (= .cse67 .cse68)) (not (= .cse69 .cse68)) (not (= .cse69 (_ bv0 32))))))) .cse3) (and .cse3 (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse72 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse70 ((_ sign_extend 16) v_prenex_12))) (let ((.cse71 (bvmul (_ bv4 32) .cse70))) (and (= (bvsrem .cse70 (_ bv3 32)) (_ bv0 32)) (not (= .cse71 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse70) c_~ARR_SIZE~0) (bvsge .cse70 (_ bv0 32)) (not (= .cse71 (_ bv12 32))) (not (= .cse71 .cse72)))))) (not (= .cse72 (_ bv0 32))) (not (= .cse72 (_ bv12 32))) (not (= (_ bv4 32) .cse72)) (not (= (_ bv8 32) .cse72))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse73 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse73 (_ bv0 32))) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse74 ((_ sign_extend 16) v_prenex_12))) (let ((.cse76 (bvmul (_ bv4 32) .cse74)) (.cse75 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse74 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse75)) (not (= (_ bv4 32) .cse75)) (not (= .cse76 (_ bv0 32))) (not (= .cse75 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse74) c_~ARR_SIZE~0) (not (= .cse75 .cse76)) (bvsge .cse74 (_ bv0 32)) (not (= .cse76 (_ bv12 32))) (not (= .cse76 .cse73)) (not (= .cse75 (_ bv0 32))))))) (not (= (_ bv8 32) .cse73))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse77 ((_ sign_extend 16) v_prenex_12))) (let ((.cse79 (bvmul (_ bv4 32) .cse77)) (.cse78 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse77 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse78)) (not (= (_ bv4 32) .cse78)) (not (= .cse79 (_ bv0 32))) (not (= .cse78 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse77) c_~ARR_SIZE~0) (not (= .cse78 .cse79)) (bvsge .cse77 (_ bv0 32)) (not (= .cse79 (_ bv12 32))) (not (= .cse79 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (not (= .cse78 (_ bv0 32))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse83 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse80 ((_ sign_extend 16) v_prenex_12))) (let ((.cse82 (bvmul (_ bv4 32) .cse80)) (.cse81 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse80 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse81)) (not (= (_ bv4 32) .cse81)) (not (= .cse82 (_ bv0 32))) (not (= .cse81 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse80) c_~ARR_SIZE~0) (not (= .cse81 .cse82)) (bvsge .cse80 (_ bv0 32)) (not (= .cse82 (_ bv12 32))) (not (= .cse82 .cse83)) (not (= .cse81 (_ bv0 32))))))) (not (= (_ bv8 32) .cse83))))))) (= (bvadd (bvmul .cse84 (_ bv7 64)) ((_ sign_extend 32) (_ bv1 32))) |c_ULTIMATE.start_main_~sum~0#1|) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse85 ((_ sign_extend 16) v_prenex_12))) (let ((.cse87 (bvmul (_ bv4 32) .cse85)) (.cse86 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse88 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse85 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse86)) (not (= (_ bv4 32) .cse86)) (not (= .cse87 (_ bv0 32))) (not (= .cse88 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse85) c_~ARR_SIZE~0) (not (= .cse88 (_ bv12 32))) (not (= .cse86 .cse87)) (bvsge .cse85 (_ bv0 32)) (not (= .cse87 (_ bv12 32))) (not (= (_ bv4 32) .cse88)) (not (= (_ bv8 32) .cse88)) (not (= .cse86 .cse88)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse89 ((_ sign_extend 16) v_prenex_12))) (let ((.cse91 (bvmul (_ bv4 32) .cse89)) (.cse92 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse90 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse89 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse90)) (not (= .cse91 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse89) c_~ARR_SIZE~0) (not (= .cse90 .cse91)) (bvsge .cse89 (_ bv0 32)) (not (= .cse91 (_ bv12 32))) (not (= .cse91 .cse92)) (not (= .cse90 .cse92)) (not (= .cse90 (_ bv0 32))))))) .cse3) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse93 ((_ sign_extend 16) v_prenex_12))) (let ((.cse95 (bvmul (_ bv4 32) .cse93)) (.cse94 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse93 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse94)) (not (= (_ bv4 32) .cse94)) (not (= .cse95 (_ bv0 32))) (not (= .cse94 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse93) c_~ARR_SIZE~0) (not (= .cse94 .cse95)) (bvsge .cse93 (_ bv0 32)) (not (= .cse95 (_ bv12 32))) (not (= .cse94 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse96 ((_ sign_extend 16) v_prenex_12))) (let ((.cse97 (bvmul (_ bv4 32) .cse96))) (and (= (bvsrem .cse96 (_ bv3 32)) (_ bv0 32)) (not (= .cse97 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse96) c_~ARR_SIZE~0) (not (= (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)) .cse97)) (bvsge .cse96 (_ bv0 32)) (not (= .cse97 (_ bv12 32))) (not (= .cse97 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse98 ((_ sign_extend 16) v_prenex_12))) (let ((.cse99 (bvmul (_ bv4 32) .cse98)) (.cse101 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse100 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse98 (_ bv3 32)) (_ bv0 32)) (not (= .cse99 (_ bv0 32))) (not (= .cse100 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse98) c_~ARR_SIZE~0) (not (= .cse101 .cse99)) (bvsge .cse98 (_ bv0 32)) (not (= .cse99 (_ bv12 32))) (not (= (_ bv8 32) .cse100)) (not (= .cse99 .cse100)) (not (= .cse101 .cse100)))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse102 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse102 (_ bv0 32))) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse103 ((_ sign_extend 16) v_prenex_12))) (let ((.cse104 (bvmul (_ bv4 32) .cse103)) (.cse105 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse103 (_ bv3 32)) (_ bv0 32)) (not (= .cse104 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse103) c_~ARR_SIZE~0) (not (= .cse105 .cse104)) (bvsge .cse103 (_ bv0 32)) (not (= .cse104 (_ bv12 32))) (not (= .cse105 .cse102)))))) (not (= .cse102 (_ bv12 32))) (not (= (_ bv4 32) .cse102)) (not (= (_ bv8 32) .cse102))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse106 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse106 (_ bv0 32))) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse107 ((_ sign_extend 16) v_prenex_12))) (let ((.cse108 (bvmul (_ bv4 32) .cse107)) (.cse109 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse107 (_ bv3 32)) (_ bv0 32)) (not (= .cse108 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse107) c_~ARR_SIZE~0) (not (= .cse109 .cse108)) (bvsge .cse107 (_ bv0 32)) (not (= .cse108 (_ bv12 32))) (not (= .cse108 .cse106)) (not (= .cse109 .cse106)))))) (not (= (_ bv4 32) .cse106)) (not (= (_ bv8 32) .cse106)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse110 ((_ sign_extend 16) v_prenex_12))) (let ((.cse111 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse112 (bvmul (_ bv4 32) .cse110))) (and (= (bvsrem .cse110 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse111)) (not (= .cse112 (_ bv0 32))) (not (= .cse111 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse110) c_~ARR_SIZE~0) (not (= .cse111 .cse112)) (bvsge .cse110 (_ bv0 32)) (not (= .cse112 (_ bv12 32))) (not (= .cse112 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse113 ((_ sign_extend 16) v_prenex_12))) (let ((.cse114 (bvmul (_ bv4 32) .cse113)) (.cse115 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse116 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse113 (_ bv3 32)) (_ bv0 32)) (not (= .cse114 (_ bv0 32))) (not (= .cse115 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse113) c_~ARR_SIZE~0) (not (= .cse115 (_ bv12 32))) (not (= .cse116 .cse114)) (bvsge .cse113 (_ bv0 32)) (not (= .cse114 (_ bv12 32))) (not (= (_ bv4 32) .cse115)) (not (= (_ bv8 32) .cse115)) (not (= .cse116 .cse115)) (not (= .cse116 (_ bv0 32)))))))) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse117 ((_ sign_extend 16) v_prenex_12))) (let ((.cse118 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse119 (bvmul (_ bv4 32) .cse117))) (and (= (bvsrem .cse117 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse118)) (not (= (_ bv4 32) .cse118)) (not (= .cse119 (_ bv0 32))) (not (= .cse118 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse117) c_~ARR_SIZE~0) (not (= .cse118 .cse119)) (bvsge .cse117 (_ bv0 32)) (not (= .cse119 (_ bv12 32))) (not (= .cse119 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))))))))) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse120 ((_ sign_extend 16) v_prenex_12))) (let ((.cse122 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse121 (bvmul (_ bv4 32) .cse120))) (and (= (bvsrem .cse120 (_ bv3 32)) (_ bv0 32)) (not (= .cse121 (_ bv0 32))) (not (= .cse122 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse120) c_~ARR_SIZE~0) (not (= .cse122 .cse121)) (bvsge .cse120 (_ bv0 32)) (not (= .cse121 (_ bv12 32))) (not (= .cse121 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))))))))) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse123 ((_ sign_extend 16) v_prenex_12))) (let ((.cse124 (bvmul (_ bv4 32) .cse123)) (.cse125 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse126 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse123 (_ bv3 32)) (_ bv0 32)) (not (= .cse124 (_ bv0 32))) (not (= .cse125 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse123) c_~ARR_SIZE~0) (not (= .cse126 .cse124)) (bvsge .cse123 (_ bv0 32)) (not (= .cse124 (_ bv12 32))) (not (= (_ bv4 32) .cse125)) (not (= (_ bv8 32) .cse125)) (not (= .cse124 .cse125)) (not (= .cse126 .cse125)) (not (= .cse126 (_ bv0 32))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse127 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse127 (_ bv0 32))) (not (= .cse127 (_ bv12 32))) (not (= (_ bv4 32) .cse127)) (not (= (_ bv8 32) .cse127)) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse128 ((_ sign_extend 16) v_prenex_12))) (let ((.cse130 (bvmul (_ bv4 32) .cse128)) (.cse129 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse128 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse129)) (not (= .cse130 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse128) c_~ARR_SIZE~0) (not (= .cse129 .cse130)) (bvsge .cse128 (_ bv0 32)) (not (= .cse130 (_ bv12 32))) (not (= .cse129 .cse127))))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse134 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse131 ((_ sign_extend 16) v_prenex_12))) (let ((.cse133 (bvmul (_ bv4 32) .cse131)) (.cse132 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse131 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse132)) (not (= .cse133 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse131) c_~ARR_SIZE~0) (not (= .cse132 .cse133)) (bvsge .cse131 (_ bv0 32)) (not (= .cse133 (_ bv12 32))) (not (= .cse133 .cse134)) (not (= .cse132 .cse134)))))) (not (= (_ bv8 32) .cse134))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse135 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse135 (_ bv0 32))) (not (= .cse135 (_ bv12 32))) (exists ((v_prenex_11 (_ BitVec 16))) (let ((.cse138 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse136 ((_ sign_extend 16) v_prenex_12))) (let ((.cse137 (bvmul (_ bv4 32) .cse136))) (and (= (bvsrem .cse136 (_ bv3 32)) (_ bv0 32)) (not (= .cse137 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse136) c_~ARR_SIZE~0) (not (= .cse138 .cse137)) (bvsge .cse136 (_ bv0 32)) (not (= .cse137 (_ bv12 32))) (not (= .cse137 .cse135)))))) (not (= (_ bv4 32) .cse138)) (not (= .cse138 .cse135))))) (not (= (_ bv4 32) .cse135)) (not (= (_ bv8 32) .cse135))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse142 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse139 ((_ sign_extend 16) v_prenex_12))) (let ((.cse141 (bvmul (_ bv4 32) .cse139)) (.cse140 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse139 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse140)) (not (= .cse141 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse139) c_~ARR_SIZE~0) (not (= .cse140 .cse141)) (bvsge .cse139 (_ bv0 32)) (not (= .cse141 (_ bv12 32))) (not (= .cse141 .cse142)) (not (= .cse140 .cse142)))))) (not (= .cse142 (_ bv0 32))) (not (= (_ bv8 32) .cse142))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse146 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse143 ((_ sign_extend 16) v_prenex_12))) (let ((.cse145 (bvmul (_ bv4 32) .cse143)) (.cse144 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse143 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse144)) (not (= .cse145 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse143) c_~ARR_SIZE~0) (not (= .cse144 .cse145)) (bvsge .cse143 (_ bv0 32)) (not (= .cse145 (_ bv12 32))) (not (= .cse145 .cse146)) (not (= .cse144 .cse146)))))) (not (= .cse146 (_ bv0 32))) (not (= (_ bv4 32) .cse146)) (not (= (_ bv8 32) .cse146))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse147 ((_ sign_extend 16) v_prenex_12))) (let ((.cse149 (bvmul (_ bv4 32) .cse147)) (.cse148 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse150 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse147 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse148)) (not (= .cse149 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse147) c_~ARR_SIZE~0) (not (= .cse148 .cse149)) (bvsge .cse147 (_ bv0 32)) (not (= .cse149 (_ bv12 32))) (not (= .cse149 .cse150)) (not (= .cse148 .cse150))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse153 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse151 ((_ sign_extend 16) v_prenex_12))) (let ((.cse152 (bvmul (_ bv4 32) .cse151))) (and (= (bvsrem .cse151 (_ bv3 32)) (_ bv0 32)) (not (= .cse152 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse151) c_~ARR_SIZE~0) (bvsge .cse151 (_ bv0 32)) (not (= .cse152 (_ bv12 32))) (not (= .cse152 .cse153)))))) (exists ((v_prenex_11 (_ BitVec 16))) (let ((.cse154 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (not (= (_ bv8 32) .cse154)) (not (= (_ bv4 32) .cse154)) (not (= .cse154 (_ bv12 32))) (not (= .cse154 .cse153)) (not (= .cse154 (_ bv0 32))))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse158 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse157 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse155 ((_ sign_extend 16) v_prenex_12))) (let ((.cse156 (bvmul (_ bv4 32) .cse155))) (and (= (bvsrem .cse155 (_ bv3 32)) (_ bv0 32)) (not (= .cse156 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse155) c_~ARR_SIZE~0) (not (= .cse157 .cse156)) (bvsge .cse155 (_ bv0 32)) (not (= .cse156 (_ bv12 32))) (not (= .cse156 .cse158)))))) (not (= (_ bv8 32) .cse157)) (not (= (_ bv4 32) .cse157)) (not (= .cse157 (_ bv12 32))) (not (= .cse157 .cse158)) (not (= .cse157 (_ bv0 32)))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse161 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse162 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse159 ((_ sign_extend 16) v_prenex_12))) (let ((.cse160 (bvmul (_ bv4 32) .cse159))) (and (= (bvsrem .cse159 (_ bv3 32)) (_ bv0 32)) (not (= .cse160 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse159) c_~ARR_SIZE~0) (not (= .cse161 .cse160)) (bvsge .cse159 (_ bv0 32)) (not (= .cse160 (_ bv12 32))) (not (= .cse160 .cse162)))))) (not (= (_ bv4 32) .cse161)) (not (= .cse161 (_ bv12 32))) (not (= .cse161 .cse162))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse166 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse165 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse163 ((_ sign_extend 16) v_prenex_12))) (let ((.cse164 (bvmul (_ bv4 32) .cse163))) (and (= (bvsrem .cse163 (_ bv3 32)) (_ bv0 32)) (not (= .cse164 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse163) c_~ARR_SIZE~0) (not (= .cse165 .cse164)) (bvsge .cse163 (_ bv0 32)) (not (= .cse164 (_ bv12 32))) (not (= .cse164 .cse166)))))) (not (= (_ bv4 32) .cse165)) (not (= .cse165 (_ bv12 32))) (not (= .cse165 .cse166)) (not (= .cse165 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse167 ((_ sign_extend 16) v_prenex_12))) (let ((.cse168 (bvmul (_ bv4 32) .cse167)) (.cse169 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse167 (_ bv3 32)) (_ bv0 32)) (not (= .cse168 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse167) c_~ARR_SIZE~0) (not (= .cse169 .cse168)) (bvsge .cse167 (_ bv0 32)) (not (= .cse168 (_ bv12 32))) (not (= .cse168 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (not (= .cse169 (_ bv0 32))))))) .cse3) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse170 ((_ sign_extend 16) v_prenex_12))) (let ((.cse171 (bvmul (_ bv4 32) .cse170))) (and (= (bvsrem .cse170 (_ bv3 32)) (_ bv0 32)) (not (= .cse171 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse170) c_~ARR_SIZE~0) (bvsge .cse170 (_ bv0 32)) (not (= .cse171 (_ bv12 32))))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse172 ((_ sign_extend 16) v_prenex_12))) (let ((.cse174 (bvmul (_ bv4 32) .cse172)) (.cse175 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse173 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse172 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse173)) (not (= .cse174 (_ bv0 32))) (not (= .cse175 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse172) c_~ARR_SIZE~0) (not (= .cse175 (_ bv12 32))) (not (= .cse173 .cse174)) (bvsge .cse172 (_ bv0 32)) (not (= .cse174 (_ bv12 32))) (not (= (_ bv4 32) .cse175)) (not (= (_ bv8 32) .cse175)) (not (= .cse173 .cse175)) (not (= .cse173 (_ bv0 32)))))))) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse176 ((_ sign_extend 16) v_prenex_12))) (let ((.cse177 (bvmul (_ bv4 32) .cse176)) (.cse179 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse178 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse176 (_ bv3 32)) (_ bv0 32)) (not (= .cse177 (_ bv0 32))) (not (= .cse178 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse176) c_~ARR_SIZE~0) (not (= .cse179 .cse177)) (bvsge .cse176 (_ bv0 32)) (not (= .cse177 (_ bv12 32))) (not (= .cse177 .cse178)) (not (= .cse179 .cse178)))))) .cse3))))) is different from false [2023-12-21 19:56:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-21 19:56:35,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:56:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1191150343] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:56:48,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:56:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 35 [2023-12-21 19:56:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119126399] [2023-12-21 19:56:48,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:56:48,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 19:56:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:56:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 19:56:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1983, Unknown=1, NotChecked=92, Total=2352 [2023-12-21 19:56:48,270 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:57:04,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:08,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:13,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:17,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:22,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:26,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:30,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:36,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:40,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:45,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse199 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse4 (= (bvadd (bvmul .cse199 (_ bv7 64)) ((_ sign_extend 32) (_ bv1 32))) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse3 (= (bvmul (_ bv8 64) .cse199) |c_ULTIMATE.start_main_~sum~0#1|))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_50| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_50|) c_~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv3 32)) c_~ARR_SIZE~0) (or (and (exists ((v_prenex_10 (_ BitVec 16)) (v_prenex_9 (_ BitVec 16))) (let ((.cse1 ((_ sign_extend 16) v_prenex_10))) (let ((.cse2 (bvmul (_ bv4 32) .cse1)) (.cse0 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_9)))) (and (not (= .cse0 (_ bv12 32))) (bvsge .cse1 (_ bv0 32)) (= (bvsrem .cse1 (_ bv3 32)) (_ bv0 32)) (not (= .cse2 (_ bv0 32))) (not (= .cse0 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse1) c_~ARR_SIZE~0) (not (= .cse2 (_ bv12 32))) (not (= .cse2 .cse0)))))) .cse3) .cse4 (and (or (exists ((v_prenex_9 (_ BitVec 16))) (let ((.cse5 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_9)))) (and (not (= .cse5 (_ bv12 32))) (not (= (_ bv4 32) .cse5)) (not (= .cse5 (_ bv0 32))) (exists ((v_prenex_10 (_ BitVec 16))) (let ((.cse6 ((_ sign_extend 16) v_prenex_10))) (let ((.cse7 (bvmul (_ bv4 32) .cse6))) (and (bvsge .cse6 (_ bv0 32)) (= (bvsrem .cse6 (_ bv3 32)) (_ bv0 32)) (not (= .cse7 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse6) c_~ARR_SIZE~0) (not (= .cse7 (_ bv12 32))) (not (= .cse7 .cse5)))))) (not (= (_ bv8 32) .cse5))))) (exists ((v_prenex_10 (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 16) v_prenex_10))) (let ((.cse9 (bvmul (_ bv4 32) .cse8))) (and (bvsge .cse8 (_ bv0 32)) (= (bvsrem .cse8 (_ bv3 32)) (_ bv0 32)) (not (= .cse9 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse8) c_~ARR_SIZE~0) (not (= .cse9 (_ bv12 32)))))))) .cse3) (and (exists ((v_prenex_10 (_ BitVec 16)) (v_prenex_9 (_ BitVec 16))) (let ((.cse11 ((_ sign_extend 16) v_prenex_10))) (let ((.cse12 (bvmul (_ bv4 32) .cse11)) (.cse10 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_9)))) (and (not (= .cse10 (_ bv12 32))) (bvsge .cse11 (_ bv0 32)) (= (bvsrem .cse11 (_ bv3 32)) (_ bv0 32)) (not (= .cse12 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse11) c_~ARR_SIZE~0) (not (= .cse12 (_ bv12 32))) (not (= (_ bv8 32) .cse10)) (not (= .cse12 .cse10)))))) .cse3) (and (exists ((v_prenex_10 (_ BitVec 16)) (v_prenex_9 (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 16) v_prenex_10))) (let ((.cse14 (bvmul (_ bv4 32) .cse13))) (and (bvsge .cse13 (_ bv0 32)) (= (bvsrem .cse13 (_ bv3 32)) (_ bv0 32)) (not (= .cse14 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse13) c_~ARR_SIZE~0) (not (= .cse14 (_ bv12 32))) (not (= .cse14 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_9)))))))) .cse3) (and (exists ((v_prenex_10 (_ BitVec 16)) (v_prenex_9 (_ BitVec 16))) (let ((.cse16 ((_ sign_extend 16) v_prenex_10))) (let ((.cse17 (bvmul (_ bv4 32) .cse16)) (.cse15 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_9)))) (and (not (= .cse15 (_ bv12 32))) (bvsge .cse16 (_ bv0 32)) (= (bvsrem .cse16 (_ bv3 32)) (_ bv0 32)) (not (= .cse17 (_ bv0 32))) (not (= .cse15 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse16) c_~ARR_SIZE~0) (not (= .cse17 (_ bv12 32))) (not (= (_ bv8 32) .cse15)) (not (= .cse17 .cse15)))))) .cse3) (and (exists ((v_prenex_10 (_ BitVec 16)) (v_prenex_9 (_ BitVec 16))) (let ((.cse19 ((_ sign_extend 16) v_prenex_10))) (let ((.cse20 (bvmul (_ bv4 32) .cse19)) (.cse18 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_9)))) (and (not (= .cse18 (_ bv12 32))) (bvsge .cse19 (_ bv0 32)) (= (bvsrem .cse19 (_ bv3 32)) (_ bv0 32)) (not (= .cse20 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse19) c_~ARR_SIZE~0) (not (= .cse20 (_ bv12 32))) (not (= .cse20 .cse18)))))) .cse3)) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (or (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 16) v_prenex_12))) (let ((.cse22 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse23 (bvmul (_ bv4 32) .cse21))) (and (= (bvsrem .cse21 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse22)) (not (= (_ bv4 32) .cse22)) (not (= .cse23 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse21) c_~ARR_SIZE~0) (not (= .cse22 .cse23)) (bvsge .cse21 (_ bv0 32)) (not (= .cse23 (_ bv12 32))) (not (= .cse23 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse24 ((_ sign_extend 16) v_prenex_12))) (let ((.cse25 (bvmul (_ bv4 32) .cse24)) (.cse27 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse26 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse24 (_ bv3 32)) (_ bv0 32)) (not (= .cse25 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse24) c_~ARR_SIZE~0) (not (= .cse26 .cse25)) (bvsge .cse24 (_ bv0 32)) (not (= .cse25 (_ bv12 32))) (not (= .cse25 .cse27)) (not (= .cse26 .cse27)) (not (= .cse26 (_ bv0 32))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse30 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse31 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse28 ((_ sign_extend 16) v_prenex_12))) (let ((.cse29 (bvmul (_ bv4 32) .cse28))) (and (= (bvsrem .cse28 (_ bv3 32)) (_ bv0 32)) (not (= .cse29 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse28) c_~ARR_SIZE~0) (not (= .cse30 .cse29)) (bvsge .cse28 (_ bv0 32)) (not (= .cse29 (_ bv12 32))) (not (= .cse29 .cse31)))))) (not (= .cse30 .cse31)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) v_prenex_12))) (let ((.cse34 (bvmul (_ bv4 32) .cse32)) (.cse33 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse35 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse32 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse33)) (not (= (_ bv4 32) .cse33)) (not (= .cse34 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse32) c_~ARR_SIZE~0) (not (= .cse33 .cse34)) (bvsge .cse32 (_ bv0 32)) (not (= .cse34 (_ bv12 32))) (not (= .cse34 .cse35)) (not (= .cse33 .cse35)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse36 ((_ sign_extend 16) v_prenex_12))) (let ((.cse38 (bvmul (_ bv4 32) .cse36)) (.cse37 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse39 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse36 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse37)) (not (= .cse38 (_ bv0 32))) (not (= .cse39 (_ bv0 32))) (not (= .cse37 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse36) c_~ARR_SIZE~0) (not (= .cse39 (_ bv12 32))) (not (= .cse37 .cse38)) (bvsge .cse36 (_ bv0 32)) (not (= .cse38 (_ bv12 32))) (not (= (_ bv4 32) .cse39)) (not (= (_ bv8 32) .cse39)) (not (= .cse37 .cse39)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse40 ((_ sign_extend 16) v_prenex_12))) (let ((.cse42 (bvmul (_ bv4 32) .cse40)) (.cse43 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse41 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse40 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse41)) (not (= (_ bv4 32) .cse41)) (not (= .cse42 (_ bv0 32))) (not (= .cse43 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse40) c_~ARR_SIZE~0) (not (= .cse43 (_ bv12 32))) (not (= .cse41 .cse42)) (bvsge .cse40 (_ bv0 32)) (not (= .cse42 (_ bv12 32))) (not (= (_ bv4 32) .cse43)) (not (= (_ bv8 32) .cse43)) (not (= .cse41 .cse43)) (not (= .cse41 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 16) v_prenex_12))) (let ((.cse45 (bvmul (_ bv4 32) .cse44)) (.cse46 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse47 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse44 (_ bv3 32)) (_ bv0 32)) (not (= .cse45 (_ bv0 32))) (not (= .cse46 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse44) c_~ARR_SIZE~0) (not (= .cse47 .cse45)) (bvsge .cse44 (_ bv0 32)) (not (= .cse45 (_ bv12 32))) (not (= .cse45 .cse46)) (not (= .cse47 .cse46)) (not (= .cse47 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse48 ((_ sign_extend 16) v_prenex_12))) (let ((.cse50 (bvmul (_ bv4 32) .cse48)) (.cse51 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse49 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse48 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse49)) (not (= .cse50 (_ bv0 32))) (not (= .cse51 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse48) c_~ARR_SIZE~0) (not (= .cse49 .cse50)) (bvsge .cse48 (_ bv0 32)) (not (= .cse50 (_ bv12 32))) (not (= .cse50 .cse51)) (not (= .cse49 (_ bv0 32))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse55 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse52 ((_ sign_extend 16) v_prenex_12))) (let ((.cse53 (bvmul (_ bv4 32) .cse52)) (.cse54 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse52 (_ bv3 32)) (_ bv0 32)) (not (= .cse53 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse52) c_~ARR_SIZE~0) (not (= .cse54 .cse53)) (bvsge .cse52 (_ bv0 32)) (not (= .cse53 (_ bv12 32))) (not (= .cse53 .cse55)) (not (= .cse54 .cse55)))))) (not (= (_ bv8 32) .cse55))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse56 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= (_ bv8 32) .cse56)) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse57 ((_ sign_extend 16) v_prenex_12))) (let ((.cse58 (bvmul (_ bv4 32) .cse57)) (.cse59 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse57 (_ bv3 32)) (_ bv0 32)) (not (= .cse58 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse57) c_~ARR_SIZE~0) (not (= .cse59 .cse58)) (bvsge .cse57 (_ bv0 32)) (not (= .cse58 (_ bv12 32))) (not (= .cse58 .cse56)) (not (= .cse59 .cse56)) (not (= .cse59 (_ bv0 32))))))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse60 ((_ sign_extend 16) v_prenex_12))) (let ((.cse62 (bvmul (_ bv4 32) .cse60)) (.cse61 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse60 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse61)) (not (= .cse62 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse60) c_~ARR_SIZE~0) (not (= .cse61 .cse62)) (bvsge .cse60 (_ bv0 32)) (not (= .cse62 (_ bv12 32))) (not (= .cse62 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (not (= .cse61 (_ bv0 32))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse65 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse63 ((_ sign_extend 16) v_prenex_12))) (let ((.cse64 (bvmul (_ bv4 32) .cse63))) (and (= (bvsrem .cse63 (_ bv3 32)) (_ bv0 32)) (not (= .cse64 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse63) c_~ARR_SIZE~0) (not (= .cse65 .cse64)) (bvsge .cse63 (_ bv0 32)) (not (= .cse64 (_ bv12 32))) (not (= .cse64 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) (not (= (_ bv4 32) .cse65)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse66 ((_ sign_extend 16) v_prenex_12))) (let ((.cse68 (bvmul (_ bv4 32) .cse66)) (.cse69 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse67 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse66 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse67)) (not (= (_ bv4 32) .cse67)) (not (= .cse68 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse66) c_~ARR_SIZE~0) (not (= .cse67 .cse68)) (bvsge .cse66 (_ bv0 32)) (not (= .cse68 (_ bv12 32))) (not (= .cse68 .cse69)) (not (= .cse67 .cse69)) (not (= .cse67 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse70 ((_ sign_extend 16) v_prenex_12))) (let ((.cse72 (bvmul (_ bv4 32) .cse70)) (.cse71 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse73 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse70 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse71)) (not (= (_ bv4 32) .cse71)) (not (= .cse72 (_ bv0 32))) (not (= .cse73 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse70) c_~ARR_SIZE~0) (not (= .cse71 .cse72)) (bvsge .cse70 (_ bv0 32)) (not (= .cse72 (_ bv12 32))) (not (= .cse72 .cse73)) (not (= .cse71 .cse73)))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse74 ((_ sign_extend 16) v_prenex_12))) (let ((.cse75 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse76 (bvmul (_ bv4 32) .cse74)) (.cse77 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse74 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse75)) (not (= .cse76 (_ bv0 32))) (not (= .cse77 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse74) c_~ARR_SIZE~0) (not (= .cse75 .cse76)) (bvsge .cse74 (_ bv0 32)) (not (= .cse76 (_ bv12 32))) (not (= .cse76 .cse77))))))) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse78 ((_ sign_extend 16) v_prenex_12))) (let ((.cse79 (bvmul (_ bv4 32) .cse78)) (.cse81 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse80 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse78 (_ bv3 32)) (_ bv0 32)) (not (= .cse79 (_ bv0 32))) (not (= .cse80 (_ bv0 32))) (not (= .cse81 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse78) c_~ARR_SIZE~0) (not (= .cse80 (_ bv12 32))) (not (= .cse81 .cse79)) (bvsge .cse78 (_ bv0 32)) (not (= .cse79 (_ bv12 32))) (not (= (_ bv4 32) .cse80)) (not (= (_ bv8 32) .cse80)) (not (= .cse81 .cse80)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse82 ((_ sign_extend 16) v_prenex_12))) (let ((.cse83 (bvmul (_ bv4 32) .cse82)) (.cse84 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse85 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse82 (_ bv3 32)) (_ bv0 32)) (not (= .cse83 (_ bv0 32))) (not (= .cse84 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse82) c_~ARR_SIZE~0) (not (= .cse84 .cse83)) (bvsge .cse82 (_ bv0 32)) (not (= .cse83 (_ bv12 32))) (not (= .cse83 .cse85)) (not (= .cse84 .cse85)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse86 ((_ sign_extend 16) v_prenex_12))) (let ((.cse87 (bvmul (_ bv4 32) .cse86)) (.cse88 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse89 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse86 (_ bv3 32)) (_ bv0 32)) (not (= .cse87 (_ bv0 32))) (not (= .cse88 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse86) c_~ARR_SIZE~0) (not (= .cse89 .cse87)) (bvsge .cse86 (_ bv0 32)) (not (= .cse87 (_ bv12 32))) (not (= (_ bv8 32) .cse88)) (not (= .cse87 .cse88)) (not (= .cse89 .cse88)) (not (= .cse89 (_ bv0 32))))))) .cse3) (and .cse3 (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse92 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse90 ((_ sign_extend 16) v_prenex_12))) (let ((.cse91 (bvmul (_ bv4 32) .cse90))) (and (= (bvsrem .cse90 (_ bv3 32)) (_ bv0 32)) (not (= .cse91 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse90) c_~ARR_SIZE~0) (bvsge .cse90 (_ bv0 32)) (not (= .cse91 (_ bv12 32))) (not (= .cse91 .cse92)))))) (not (= .cse92 (_ bv0 32))) (not (= .cse92 (_ bv12 32))) (not (= (_ bv4 32) .cse92)) (not (= (_ bv8 32) .cse92))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse93 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse93 (_ bv0 32))) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse94 ((_ sign_extend 16) v_prenex_12))) (let ((.cse96 (bvmul (_ bv4 32) .cse94)) (.cse95 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse94 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse95)) (not (= (_ bv4 32) .cse95)) (not (= .cse96 (_ bv0 32))) (not (= .cse95 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse94) c_~ARR_SIZE~0) (not (= .cse95 .cse96)) (bvsge .cse94 (_ bv0 32)) (not (= .cse96 (_ bv12 32))) (not (= .cse96 .cse93)) (not (= .cse95 (_ bv0 32))))))) (not (= (_ bv8 32) .cse93))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse97 ((_ sign_extend 16) v_prenex_12))) (let ((.cse99 (bvmul (_ bv4 32) .cse97)) (.cse98 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse97 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse98)) (not (= (_ bv4 32) .cse98)) (not (= .cse99 (_ bv0 32))) (not (= .cse98 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse97) c_~ARR_SIZE~0) (not (= .cse98 .cse99)) (bvsge .cse97 (_ bv0 32)) (not (= .cse99 (_ bv12 32))) (not (= .cse99 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (not (= .cse98 (_ bv0 32))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse103 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse100 ((_ sign_extend 16) v_prenex_12))) (let ((.cse102 (bvmul (_ bv4 32) .cse100)) (.cse101 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse100 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse101)) (not (= (_ bv4 32) .cse101)) (not (= .cse102 (_ bv0 32))) (not (= .cse101 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse100) c_~ARR_SIZE~0) (not (= .cse101 .cse102)) (bvsge .cse100 (_ bv0 32)) (not (= .cse102 (_ bv12 32))) (not (= .cse102 .cse103)) (not (= .cse101 (_ bv0 32))))))) (not (= (_ bv8 32) .cse103))))))) .cse4 (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse104 ((_ sign_extend 16) v_prenex_12))) (let ((.cse106 (bvmul (_ bv4 32) .cse104)) (.cse105 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse107 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse104 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse105)) (not (= (_ bv4 32) .cse105)) (not (= .cse106 (_ bv0 32))) (not (= .cse107 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse104) c_~ARR_SIZE~0) (not (= .cse107 (_ bv12 32))) (not (= .cse105 .cse106)) (bvsge .cse104 (_ bv0 32)) (not (= .cse106 (_ bv12 32))) (not (= (_ bv4 32) .cse107)) (not (= (_ bv8 32) .cse107)) (not (= .cse105 .cse107)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse108 ((_ sign_extend 16) v_prenex_12))) (let ((.cse110 (bvmul (_ bv4 32) .cse108)) (.cse111 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse109 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse108 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse109)) (not (= .cse110 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse108) c_~ARR_SIZE~0) (not (= .cse109 .cse110)) (bvsge .cse108 (_ bv0 32)) (not (= .cse110 (_ bv12 32))) (not (= .cse110 .cse111)) (not (= .cse109 .cse111)) (not (= .cse109 (_ bv0 32))))))) .cse3) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse112 ((_ sign_extend 16) v_prenex_12))) (let ((.cse114 (bvmul (_ bv4 32) .cse112)) (.cse113 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse112 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse113)) (not (= (_ bv4 32) .cse113)) (not (= .cse114 (_ bv0 32))) (not (= .cse113 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse112) c_~ARR_SIZE~0) (not (= .cse113 .cse114)) (bvsge .cse112 (_ bv0 32)) (not (= .cse114 (_ bv12 32))) (not (= .cse113 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse115 ((_ sign_extend 16) v_prenex_12))) (let ((.cse116 (bvmul (_ bv4 32) .cse115))) (and (= (bvsrem .cse115 (_ bv3 32)) (_ bv0 32)) (not (= .cse116 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse115) c_~ARR_SIZE~0) (not (= (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)) .cse116)) (bvsge .cse115 (_ bv0 32)) (not (= .cse116 (_ bv12 32))) (not (= .cse116 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse117 ((_ sign_extend 16) v_prenex_12))) (let ((.cse118 (bvmul (_ bv4 32) .cse117)) (.cse120 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse119 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse117 (_ bv3 32)) (_ bv0 32)) (not (= .cse118 (_ bv0 32))) (not (= .cse119 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse117) c_~ARR_SIZE~0) (not (= .cse120 .cse118)) (bvsge .cse117 (_ bv0 32)) (not (= .cse118 (_ bv12 32))) (not (= (_ bv8 32) .cse119)) (not (= .cse118 .cse119)) (not (= .cse120 .cse119)))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse121 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse121 (_ bv0 32))) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse122 ((_ sign_extend 16) v_prenex_12))) (let ((.cse123 (bvmul (_ bv4 32) .cse122)) (.cse124 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse122 (_ bv3 32)) (_ bv0 32)) (not (= .cse123 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse122) c_~ARR_SIZE~0) (not (= .cse124 .cse123)) (bvsge .cse122 (_ bv0 32)) (not (= .cse123 (_ bv12 32))) (not (= .cse124 .cse121)))))) (not (= .cse121 (_ bv12 32))) (not (= (_ bv4 32) .cse121)) (not (= (_ bv8 32) .cse121))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse125 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse125 (_ bv0 32))) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse126 ((_ sign_extend 16) v_prenex_12))) (let ((.cse127 (bvmul (_ bv4 32) .cse126)) (.cse128 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse126 (_ bv3 32)) (_ bv0 32)) (not (= .cse127 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse126) c_~ARR_SIZE~0) (not (= .cse128 .cse127)) (bvsge .cse126 (_ bv0 32)) (not (= .cse127 (_ bv12 32))) (not (= .cse127 .cse125)) (not (= .cse128 .cse125)))))) (not (= (_ bv4 32) .cse125)) (not (= (_ bv8 32) .cse125)))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse129 ((_ sign_extend 16) v_prenex_12))) (let ((.cse130 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse131 (bvmul (_ bv4 32) .cse129))) (and (= (bvsrem .cse129 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse130)) (not (= .cse131 (_ bv0 32))) (not (= .cse130 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse129) c_~ARR_SIZE~0) (not (= .cse130 .cse131)) (bvsge .cse129 (_ bv0 32)) (not (= .cse131 (_ bv12 32))) (not (= .cse131 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse132 ((_ sign_extend 16) v_prenex_12))) (let ((.cse133 (bvmul (_ bv4 32) .cse132)) (.cse134 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse135 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse132 (_ bv3 32)) (_ bv0 32)) (not (= .cse133 (_ bv0 32))) (not (= .cse134 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse132) c_~ARR_SIZE~0) (not (= .cse134 (_ bv12 32))) (not (= .cse135 .cse133)) (bvsge .cse132 (_ bv0 32)) (not (= .cse133 (_ bv12 32))) (not (= (_ bv4 32) .cse134)) (not (= (_ bv8 32) .cse134)) (not (= .cse135 .cse134)) (not (= .cse135 (_ bv0 32)))))))) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse136 ((_ sign_extend 16) v_prenex_12))) (let ((.cse137 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse138 (bvmul (_ bv4 32) .cse136))) (and (= (bvsrem .cse136 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv8 32) .cse137)) (not (= (_ bv4 32) .cse137)) (not (= .cse138 (_ bv0 32))) (not (= .cse137 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse136) c_~ARR_SIZE~0) (not (= .cse137 .cse138)) (bvsge .cse136 (_ bv0 32)) (not (= .cse138 (_ bv12 32))) (not (= .cse138 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))))))))) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse139 ((_ sign_extend 16) v_prenex_12))) (let ((.cse141 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse140 (bvmul (_ bv4 32) .cse139))) (and (= (bvsrem .cse139 (_ bv3 32)) (_ bv0 32)) (not (= .cse140 (_ bv0 32))) (not (= .cse141 (_ bv12 32))) (bvslt ((_ sign_extend 32) .cse139) c_~ARR_SIZE~0) (not (= .cse141 .cse140)) (bvsge .cse139 (_ bv0 32)) (not (= .cse140 (_ bv12 32))) (not (= .cse140 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))))))))) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse142 ((_ sign_extend 16) v_prenex_12))) (let ((.cse143 (bvmul (_ bv4 32) .cse142)) (.cse144 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse145 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse142 (_ bv3 32)) (_ bv0 32)) (not (= .cse143 (_ bv0 32))) (not (= .cse144 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse142) c_~ARR_SIZE~0) (not (= .cse145 .cse143)) (bvsge .cse142 (_ bv0 32)) (not (= .cse143 (_ bv12 32))) (not (= (_ bv4 32) .cse144)) (not (= (_ bv8 32) .cse144)) (not (= .cse143 .cse144)) (not (= .cse145 .cse144)) (not (= .cse145 (_ bv0 32))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse146 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse146 (_ bv0 32))) (not (= .cse146 (_ bv12 32))) (not (= (_ bv4 32) .cse146)) (not (= (_ bv8 32) .cse146)) (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse147 ((_ sign_extend 16) v_prenex_12))) (let ((.cse149 (bvmul (_ bv4 32) .cse147)) (.cse148 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse147 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse148)) (not (= .cse149 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse147) c_~ARR_SIZE~0) (not (= .cse148 .cse149)) (bvsge .cse147 (_ bv0 32)) (not (= .cse149 (_ bv12 32))) (not (= .cse148 .cse146))))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse153 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse150 ((_ sign_extend 16) v_prenex_12))) (let ((.cse152 (bvmul (_ bv4 32) .cse150)) (.cse151 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse150 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse151)) (not (= .cse152 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse150) c_~ARR_SIZE~0) (not (= .cse151 .cse152)) (bvsge .cse150 (_ bv0 32)) (not (= .cse152 (_ bv12 32))) (not (= .cse152 .cse153)) (not (= .cse151 .cse153)))))) (not (= (_ bv8 32) .cse153))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse154 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (not (= .cse154 (_ bv0 32))) (not (= .cse154 (_ bv12 32))) (exists ((v_prenex_11 (_ BitVec 16))) (let ((.cse157 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse155 ((_ sign_extend 16) v_prenex_12))) (let ((.cse156 (bvmul (_ bv4 32) .cse155))) (and (= (bvsrem .cse155 (_ bv3 32)) (_ bv0 32)) (not (= .cse156 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse155) c_~ARR_SIZE~0) (not (= .cse157 .cse156)) (bvsge .cse155 (_ bv0 32)) (not (= .cse156 (_ bv12 32))) (not (= .cse156 .cse154)))))) (not (= (_ bv4 32) .cse157)) (not (= .cse157 .cse154))))) (not (= (_ bv4 32) .cse154)) (not (= (_ bv8 32) .cse154))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse161 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse158 ((_ sign_extend 16) v_prenex_12))) (let ((.cse160 (bvmul (_ bv4 32) .cse158)) (.cse159 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse158 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse159)) (not (= .cse160 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse158) c_~ARR_SIZE~0) (not (= .cse159 .cse160)) (bvsge .cse158 (_ bv0 32)) (not (= .cse160 (_ bv12 32))) (not (= .cse160 .cse161)) (not (= .cse159 .cse161)))))) (not (= .cse161 (_ bv0 32))) (not (= (_ bv8 32) .cse161))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse165 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse162 ((_ sign_extend 16) v_prenex_12))) (let ((.cse164 (bvmul (_ bv4 32) .cse162)) (.cse163 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse162 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse163)) (not (= .cse164 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse162) c_~ARR_SIZE~0) (not (= .cse163 .cse164)) (bvsge .cse162 (_ bv0 32)) (not (= .cse164 (_ bv12 32))) (not (= .cse164 .cse165)) (not (= .cse163 .cse165)))))) (not (= .cse165 (_ bv0 32))) (not (= (_ bv4 32) .cse165)) (not (= (_ bv8 32) .cse165))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse166 ((_ sign_extend 16) v_prenex_12))) (let ((.cse168 (bvmul (_ bv4 32) .cse166)) (.cse167 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse169 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse166 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse167)) (not (= .cse168 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse166) c_~ARR_SIZE~0) (not (= .cse167 .cse168)) (bvsge .cse166 (_ bv0 32)) (not (= .cse168 (_ bv12 32))) (not (= .cse168 .cse169)) (not (= .cse167 .cse169))))))) .cse3) (and (or (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16))) (let ((.cse172 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse170 ((_ sign_extend 16) v_prenex_12))) (let ((.cse171 (bvmul (_ bv4 32) .cse170))) (and (= (bvsrem .cse170 (_ bv3 32)) (_ bv0 32)) (not (= .cse171 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse170) c_~ARR_SIZE~0) (bvsge .cse170 (_ bv0 32)) (not (= .cse171 (_ bv12 32))) (not (= .cse171 .cse172)))))) (exists ((v_prenex_11 (_ BitVec 16))) (let ((.cse173 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (not (= (_ bv8 32) .cse173)) (not (= (_ bv4 32) .cse173)) (not (= .cse173 (_ bv12 32))) (not (= .cse173 .cse172)) (not (= .cse173 (_ bv0 32))))))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse177 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse176 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse174 ((_ sign_extend 16) v_prenex_12))) (let ((.cse175 (bvmul (_ bv4 32) .cse174))) (and (= (bvsrem .cse174 (_ bv3 32)) (_ bv0 32)) (not (= .cse175 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse174) c_~ARR_SIZE~0) (not (= .cse176 .cse175)) (bvsge .cse174 (_ bv0 32)) (not (= .cse175 (_ bv12 32))) (not (= .cse175 .cse177)))))) (not (= (_ bv8 32) .cse176)) (not (= (_ bv4 32) .cse176)) (not (= .cse176 (_ bv12 32))) (not (= .cse176 .cse177)) (not (= .cse176 (_ bv0 32)))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse180 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse181 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse178 ((_ sign_extend 16) v_prenex_12))) (let ((.cse179 (bvmul (_ bv4 32) .cse178))) (and (= (bvsrem .cse178 (_ bv3 32)) (_ bv0 32)) (not (= .cse179 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse178) c_~ARR_SIZE~0) (not (= .cse180 .cse179)) (bvsge .cse178 (_ bv0 32)) (not (= .cse179 (_ bv12 32))) (not (= .cse179 .cse181)))))) (not (= (_ bv4 32) .cse180)) (not (= .cse180 (_ bv12 32))) (not (= .cse180 .cse181))))) (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse185 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse184 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse182 ((_ sign_extend 16) v_prenex_12))) (let ((.cse183 (bvmul (_ bv4 32) .cse182))) (and (= (bvsrem .cse182 (_ bv3 32)) (_ bv0 32)) (not (= .cse183 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse182) c_~ARR_SIZE~0) (not (= .cse184 .cse183)) (bvsge .cse182 (_ bv0 32)) (not (= .cse183 (_ bv12 32))) (not (= .cse183 .cse185)))))) (not (= (_ bv4 32) .cse184)) (not (= .cse184 (_ bv12 32))) (not (= .cse184 .cse185)) (not (= .cse184 (_ bv0 32))))))) .cse3) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse186 ((_ sign_extend 16) v_prenex_12))) (let ((.cse187 (bvmul (_ bv4 32) .cse186)) (.cse188 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse186 (_ bv3 32)) (_ bv0 32)) (not (= .cse187 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse186) c_~ARR_SIZE~0) (not (= .cse188 .cse187)) (bvsge .cse186 (_ bv0 32)) (not (= .cse187 (_ bv12 32))) (not (= .cse187 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (not (= .cse188 (_ bv0 32))))))) .cse3) (and (exists ((v_prenex_12 (_ BitVec 16))) (let ((.cse189 ((_ sign_extend 16) v_prenex_12))) (let ((.cse190 (bvmul (_ bv4 32) .cse189))) (and (= (bvsrem .cse189 (_ bv3 32)) (_ bv0 32)) (not (= .cse190 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse189) c_~ARR_SIZE~0) (bvsge .cse189 (_ bv0 32)) (not (= .cse190 (_ bv12 32))))))) .cse3) (and .cse3 (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse191 ((_ sign_extend 16) v_prenex_12))) (let ((.cse193 (bvmul (_ bv4 32) .cse191)) (.cse194 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32))) (.cse192 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11)))) (and (= (bvsrem .cse191 (_ bv3 32)) (_ bv0 32)) (not (= (_ bv4 32) .cse192)) (not (= .cse193 (_ bv0 32))) (not (= .cse194 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse191) c_~ARR_SIZE~0) (not (= .cse194 (_ bv12 32))) (not (= .cse192 .cse193)) (bvsge .cse191 (_ bv0 32)) (not (= .cse193 (_ bv12 32))) (not (= (_ bv4 32) .cse194)) (not (= (_ bv8 32) .cse194)) (not (= .cse192 .cse194)) (not (= .cse192 (_ bv0 32)))))))) (and (exists ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 16)) (v_prenex_12 (_ BitVec 16)) (v_prenex_11 (_ BitVec 16))) (let ((.cse195 ((_ sign_extend 16) v_prenex_12))) (let ((.cse196 (bvmul (_ bv4 32) .cse195)) (.cse198 (bvmul (_ bv4 32) ((_ sign_extend 16) v_prenex_11))) (.cse197 (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index~0#1|) (_ bv4 32)))) (and (= (bvsrem .cse195 (_ bv3 32)) (_ bv0 32)) (not (= .cse196 (_ bv0 32))) (not (= .cse197 (_ bv0 32))) (bvslt ((_ sign_extend 32) .cse195) c_~ARR_SIZE~0) (not (= .cse198 .cse196)) (bvsge .cse195 (_ bv0 32)) (not (= .cse196 (_ bv12 32))) (not (= .cse196 .cse197)) (not (= .cse198 .cse197)))))) .cse3))))) is different from false [2023-12-21 19:57:50,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:54,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 19:57:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:57:56,864 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2023-12-21 19:57:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 19:57:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2023-12-21 19:57:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:57:56,865 INFO L225 Difference]: With dead ends: 137 [2023-12-21 19:57:56,865 INFO L226 Difference]: Without dead ends: 133 [2023-12-21 19:57:56,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 93.4s TimeCoverageRelationStatistics Valid=321, Invalid=2441, Unknown=2, NotChecked=206, Total=2970 [2023-12-21 19:57:56,866 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 56.6s IncrementalHoareTripleChecker+Time [2023-12-21 19:57:56,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 357 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 808 Invalid, 11 Unknown, 134 Unchecked, 56.6s Time] [2023-12-21 19:57:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-21 19:57:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2023-12-21 19:57:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 19:57:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2023-12-21 19:57:56,905 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 32 [2023-12-21 19:57:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:57:56,905 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2023-12-21 19:57:56,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:57:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2023-12-21 19:57:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 19:57:56,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:57:56,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:57:56,912 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 (20)] Forceful destruction successful, exit code 0 [2023-12-21 19:57:57,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-21 19:57:57,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-21 19:57:57,307 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:57:57,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:57:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1184074004, now seen corresponding path program 3 times [2023-12-21 19:57:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:57:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110853355] [2023-12-21 19:57:57,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:57:57,308 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:57:57,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:57:57,309 INFO L229 MonitoredProcess]: Starting monitored process 22 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:57:57,338 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 (22)] Waiting until timeout for monitored process [2023-12-21 19:57:57,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 19:57:57,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:57:57,585 WARN L260 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-21 19:57:57,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:57:58,438 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:57:58,488 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:57:58,841 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:57:58,910 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:57:59,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:57:59,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:57:59,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:57:59,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 19:58:00,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:58:00,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-21 19:58:00,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:58:00,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-21 19:58:05,672 INFO L349 Elim1Store]: treesize reduction 196, result has 34.0 percent of original size [2023-12-21 19:58:05,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 71 treesize of output 135 [2023-12-21 19:58:09,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:58:09,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:58:10,516 INFO L349 Elim1Store]: treesize reduction 122, result has 29.5 percent of original size [2023-12-21 19:58:10,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 71 treesize of output 115 [2023-12-21 19:58:25,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:58:25,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 205 treesize of output 330 [2023-12-21 19:58:27,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:58:27,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 164 treesize of output 285 [2023-12-21 20:00:41,343 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:00:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:00:57,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-21 20:01:57,339 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 20:01:57,349 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 (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:01:57,561 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 20:01:57,566 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 (22)] Forceful destruction successful, exit code 0 [2023-12-21 20:01:57,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 20:01:57,762 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. [2023-12-21 20:01:57,765 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1] [2023-12-21 20:01:57,767 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 20:01:57,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:01:57 BoogieIcfgContainer [2023-12-21 20:01:57,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 20:01:57,769 INFO L158 Benchmark]: Toolchain (without parser) took 880763.77ms. Allocated memory is still 265.3MB. Free memory was 214.1MB in the beginning and 162.1MB in the end (delta: 52.0MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2023-12-21 20:01:57,769 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory was 121.6MB in the beginning and 121.5MB in the end (delta: 130.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:01:57,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.78ms. Allocated memory is still 265.3MB. Free memory was 213.6MB in the beginning and 202.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 20:01:57,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.02ms. Allocated memory is still 265.3MB. Free memory was 202.1MB in the beginning and 200.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:01:57,770 INFO L158 Benchmark]: Boogie Preprocessor took 40.13ms. Allocated memory is still 265.3MB. Free memory was 200.0MB in the beginning and 197.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:01:57,770 INFO L158 Benchmark]: RCFGBuilder took 426.78ms. Allocated memory is still 265.3MB. Free memory was 197.9MB in the beginning and 182.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 20:01:57,770 INFO L158 Benchmark]: TraceAbstraction took 880048.59ms. Allocated memory is still 265.3MB. Free memory was 181.6MB in the beginning and 162.1MB in the end (delta: 19.5MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2023-12-21 20:01:57,771 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.10ms. Allocated memory is still 168.8MB. Free memory was 121.6MB in the beginning and 121.5MB in the end (delta: 130.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.78ms. Allocated memory is still 265.3MB. Free memory was 213.6MB in the beginning and 202.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.02ms. Allocated memory is still 265.3MB. Free memory was 202.1MB in the beginning and 200.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.13ms. Allocated memory is still 265.3MB. Free memory was 200.0MB in the beginning and 197.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.78ms. Allocated memory is still 265.3MB. Free memory was 197.9MB in the beginning and 182.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 880048.59ms. Allocated memory is still 265.3MB. Free memory was 181.6MB in the beginning and 162.1MB in the end (delta: 19.5MB). Peak memory consumption was 20.1MB. 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 33 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.0s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 199.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 980 SdHoareTripleChecker+Valid, 145.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 2413 SdHoareTripleChecker+Invalid, 143.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 134 IncrementalHoareTripleChecker+Unchecked, 2127 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4554 IncrementalHoareTripleChecker+Invalid, 4945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 286 mSDtfsCounter, 4554 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 957 GetRequests, 483 SyntacticMatches, 22 SemanticMatches, 452 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6522 ImplicationChecksByTransitivity, 333.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=14, InterpolantAutomatonStates: 274, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 109 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 429.6s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 696 ConstructedInterpolants, 461 QuantifiedInterpolants, 24804 SizeOfPredicates, 200 NumberOfNonLiveVariables, 1701 ConjunctsInSsa, 637 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 103/301 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