./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/running_example.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/running_example.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:01:40,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:01:40,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:01:40,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:01:40,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:01:40,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:01:40,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:01:40,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:01:40,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:01:40,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:01:40,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:01:40,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:01:40,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:01:40,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:01:40,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:01:40,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:01:40,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:01:40,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:01:40,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:01:40,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:01:40,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:01:40,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:01:40,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:01:40,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:01:40,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:01:40,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:01:40,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:01:40,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:01:40,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:01:40,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:01:40,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:01:40,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:01:40,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:01:40,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:01:40,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:01:40,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:01:40,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:01:40,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:01:40,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:01:40,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:01:40,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:01:40,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:01:40,965 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f [2024-11-18 13:01:41,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:01:41,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:01:41,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:01:41,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:01:41,273 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:01:41,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/running_example.i [2024-11-18 13:01:42,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:01:43,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:01:43,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/running_example.i [2024-11-18 13:01:43,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da803fa44/114c72bd86e940e591606b445fff36e8/FLAGc8d49da55 [2024-11-18 13:01:43,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da803fa44/114c72bd86e940e591606b445fff36e8 [2024-11-18 13:01:43,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:01:43,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:01:43,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:01:43,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:01:43,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:01:43,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410d486a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43, skipping insertion in model container [2024-11-18 13:01:43,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:01:43,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2024-11-18 13:01:43,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:01:43,806 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:01:43,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/running_example.i[23610,23623] [2024-11-18 13:01:43,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:01:43,883 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:01:43,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43 WrapperNode [2024-11-18 13:01:43,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:01:43,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:01:43,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:01:43,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:01:43,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,928 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2024-11-18 13:01:43,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:01:43,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:01:43,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:01:43,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:01:43,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,956 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-18 13:01:43,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:01:43,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:01:43,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:01:43,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:01:43,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (1/1) ... [2024-11-18 13:01:43,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:01:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:44,020 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) [2024-11-18 13:01:44,022 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 [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:01:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:01:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:01:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:01:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:01:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:01:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:01:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:01:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:01:44,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:01:44,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:01:44,313 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 13:01:44,313 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:01:44,325 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:01:44,325 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-18 13:01:44,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:01:44 BoogieIcfgContainer [2024-11-18 13:01:44,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:01:44,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:01:44,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:01:44,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:01:44,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:01:43" (1/3) ... [2024-11-18 13:01:44,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13596829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:01:44, skipping insertion in model container [2024-11-18 13:01:44,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:43" (2/3) ... [2024-11-18 13:01:44,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13596829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:01:44, skipping insertion in model container [2024-11-18 13:01:44,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:01:44" (3/3) ... [2024-11-18 13:01:44,338 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example.i [2024-11-18 13:01:44,353 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:01:44,353 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:01:44,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:01:44,410 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6e410008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:01:44,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:01:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 13:01:44,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:44,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:44,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 538476752, now seen corresponding path program 1 times [2024-11-18 13:01:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146849694] [2024-11-18 13:01:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:44,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146849694] [2024-11-18 13:01:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146849694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:01:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906197014] [2024-11-18 13:01:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:44,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:01:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:01:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:01:44,703 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:44,718 INFO L93 Difference]: Finished difference Result 27 states and 43 transitions. [2024-11-18 13:01:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:01:44,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-18 13:01:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:44,729 INFO L225 Difference]: With dead ends: 27 [2024-11-18 13:01:44,729 INFO L226 Difference]: Without dead ends: 15 [2024-11-18 13:01:44,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:01:44,737 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:44,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:01:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-18 13:01:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-18 13:01:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-18 13:01:44,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 8 [2024-11-18 13:01:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:44,829 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-18 13:01:44,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2024-11-18 13:01:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-18 13:01:44,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:44,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:44,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:01:44,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:44,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1314112902, now seen corresponding path program 1 times [2024-11-18 13:01:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138489954] [2024-11-18 13:01:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:44,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:45,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:45,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138489954] [2024-11-18 13:01:45,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138489954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:45,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:45,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 13:01:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570892987] [2024-11-18 13:01:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:45,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 13:01:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 13:01:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:01:45,236 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:45,343 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2024-11-18 13:01:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 13:01:45,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-18 13:01:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:45,345 INFO L225 Difference]: With dead ends: 35 [2024-11-18 13:01:45,345 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 13:01:45,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:01:45,346 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:45,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:01:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 13:01:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-18 13:01:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-18 13:01:45,355 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2024-11-18 13:01:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:45,356 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-18 13:01:45,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-18 13:01:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 13:01:45,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:45,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:45,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:01:45,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1215852288, now seen corresponding path program 1 times [2024-11-18 13:01:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274957372] [2024-11-18 13:01:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:45,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274957372] [2024-11-18 13:01:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274957372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014362810] [2024-11-18 13:01:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:45,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:45,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:45,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:45,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:01:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:45,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-18 13:01:45,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:45,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:01:45,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:01:46,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:46,144 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-18 13:01:46,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:46,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-18 13:01:46,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:01:46,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-18 13:01:46,312 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 15 treesize of output 7 [2024-11-18 13:01:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:46,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:46,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014362810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:46,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:46,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-18 13:01:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860176461] [2024-11-18 13:01:46,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:46,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:01:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:01:46,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:01:46,473 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:46,719 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-11-18 13:01:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 13:01:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-18 13:01:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:46,722 INFO L225 Difference]: With dead ends: 61 [2024-11-18 13:01:46,722 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 13:01:46,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2024-11-18 13:01:46,724 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:46,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 71 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:01:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 13:01:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2024-11-18 13:01:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2024-11-18 13:01:46,738 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 14 [2024-11-18 13:01:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:46,738 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-11-18 13:01:46,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2024-11-18 13:01:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 13:01:46,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:46,739 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:46,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 13:01:46,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:46,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:46,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:46,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1215850366, now seen corresponding path program 1 times [2024-11-18 13:01:46,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:46,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168625656] [2024-11-18 13:01:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:47,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:47,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168625656] [2024-11-18 13:01:47,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168625656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033847593] [2024-11-18 13:01:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:47,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:47,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:47,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:47,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:01:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:47,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-18 13:01:47,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:47,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:01:47,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:01:47,398 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 39 treesize of output 22 [2024-11-18 13:01:47,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:47,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 11 [2024-11-18 13:01:47,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:01:47,484 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 15 treesize of output 7 [2024-11-18 13:01:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:47,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:47,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_22| Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_157) |v_ULTIMATE.start_main_~p~0#1.base_22| v_ArrVal_155) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 21) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_22|) 0)) (not (= v_ArrVal_157 (let ((.cse0 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_157 .cse0))))))) is different from false [2024-11-18 13:01:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-18 13:01:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033847593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:47,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-18 13:01:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261794361] [2024-11-18 13:01:47,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:47,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 13:01:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 13:01:47,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-18 13:01:47,623 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:48,057 INFO L93 Difference]: Finished difference Result 127 states and 181 transitions. [2024-11-18 13:01:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 13:01:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-18 13:01:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:48,059 INFO L225 Difference]: With dead ends: 127 [2024-11-18 13:01:48,059 INFO L226 Difference]: Without dead ends: 108 [2024-11-18 13:01:48,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=354, Unknown=1, NotChecked=42, Total=552 [2024-11-18 13:01:48,060 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 121 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:48,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 136 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 147 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2024-11-18 13:01:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-18 13:01:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 67. [2024-11-18 13:01:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5) internal successors, (99), 66 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-18 13:01:48,084 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 14 [2024-11-18 13:01:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:48,085 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-18 13:01:48,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-18 13:01:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:01:48,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:48,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:48,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:01:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 13:01:48,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 658296035, now seen corresponding path program 1 times [2024-11-18 13:01:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630545331] [2024-11-18 13:01:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:48,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:48,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630545331] [2024-11-18 13:01:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630545331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:48,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284180456] [2024-11-18 13:01:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:48,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:48,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:48,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:48,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:01:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:48,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 13:01:48,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:48,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:01:48,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:01:48,695 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 [2024-11-18 13:01:48,705 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 [2024-11-18 13:01:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:48,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284180456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:48,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:48,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-18 13:01:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365463390] [2024-11-18 13:01:48,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:48,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 13:01:48,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 13:01:48,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:01:48,792 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:48,892 INFO L93 Difference]: Finished difference Result 157 states and 233 transitions. [2024-11-18 13:01:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:01:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-18 13:01:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:48,894 INFO L225 Difference]: With dead ends: 157 [2024-11-18 13:01:48,895 INFO L226 Difference]: Without dead ends: 116 [2024-11-18 13:01:48,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:01:48,896 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:48,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:01:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-18 13:01:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-18 13:01:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 113 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-18 13:01:48,923 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 16 [2024-11-18 13:01:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:48,923 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-18 13:01:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-18 13:01:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 13:01:48,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:48,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:48,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 13:01:49,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:49,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 385260059, now seen corresponding path program 1 times [2024-11-18 13:01:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279956529] [2024-11-18 13:01:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:01:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279956529] [2024-11-18 13:01:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279956529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:01:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691524829] [2024-11-18 13:01:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:49,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:01:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:01:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:01:49,262 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:49,333 INFO L93 Difference]: Finished difference Result 132 states and 188 transitions. [2024-11-18 13:01:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:01:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-18 13:01:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:49,335 INFO L225 Difference]: With dead ends: 132 [2024-11-18 13:01:49,335 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 13:01:49,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:01:49,339 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:49,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:01:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 13:01:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-18 13:01:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-18 13:01:49,368 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 18 [2024-11-18 13:01:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:49,368 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-18 13:01:49,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-18 13:01:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 13:01:49,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:49,370 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:49,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 13:01:49,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:49,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash 455621640, now seen corresponding path program 2 times [2024-11-18 13:01:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:49,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968874644] [2024-11-18 13:01:49,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:01:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:49,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:01:49,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:01:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:49,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968874644] [2024-11-18 13:01:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968874644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413966960] [2024-11-18 13:01:49,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:01:49,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:49,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:49,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:01:49,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:01:49,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:01:49,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-18 13:01:49,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:49,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:01:49,791 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 [2024-11-18 13:01:49,869 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:01:49,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:01:49,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-18 13:01:49,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-18 13:01:49,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-11-18 13:01:49,966 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:01:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-11-18 13:01:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:50,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413966960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:50,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-18 13:01:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265606737] [2024-11-18 13:01:50,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:50,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 13:01:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 13:01:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-18 13:01:50,218 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:50,930 INFO L93 Difference]: Finished difference Result 250 states and 364 transitions. [2024-11-18 13:01:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 13:01:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-18 13:01:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:50,932 INFO L225 Difference]: With dead ends: 250 [2024-11-18 13:01:50,932 INFO L226 Difference]: Without dead ends: 231 [2024-11-18 13:01:50,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=512, Unknown=2, NotChecked=0, Total=702 [2024-11-18 13:01:50,934 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 163 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:50,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 130 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 13:01:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-18 13:01:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 112. [2024-11-18 13:01:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 111 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-18 13:01:50,957 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 18 [2024-11-18 13:01:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:50,957 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-18 13:01:50,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-18 13:01:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:01:50,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:50,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:50,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:01:51,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:51,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 625125097, now seen corresponding path program 1 times [2024-11-18 13:01:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675669441] [2024-11-18 13:01:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675669441] [2024-11-18 13:01:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675669441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558680608] [2024-11-18 13:01:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:51,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:51,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:51,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:51,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:01:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:51,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-18 13:01:51,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:01:51,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:01:51,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:01:51,721 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:01:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 69 [2024-11-18 13:01:51,735 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:01:51,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-18 13:01:51,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-18 13:01:51,746 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 24 treesize of output 11 [2024-11-18 13:01:51,883 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 [2024-11-18 13:01:51,889 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 35 treesize of output 19 [2024-11-18 13:01:51,896 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 20 treesize of output 15 [2024-11-18 13:01:51,910 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 27 treesize of output 15 [2024-11-18 13:01:51,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-18 13:01:51,948 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 15 treesize of output 7 [2024-11-18 13:01:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:51,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:52,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-18 13:01:52,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,090 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 154 treesize of output 105 [2024-11-18 13:01:52,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2024-11-18 13:01:52,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2024-11-18 13:01:52,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,140 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 108 treesize of output 101 [2024-11-18 13:01:52,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2024-11-18 13:01:52,205 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 73 treesize of output 61 [2024-11-18 13:01:52,217 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 45 [2024-11-18 13:01:52,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:52,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-18 13:01:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558680608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:52,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2024-11-18 13:01:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706118782] [2024-11-18 13:01:52,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 13:01:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 13:01:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=157, Unknown=14, NotChecked=0, Total=210 [2024-11-18 13:01:52,601 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:52,898 INFO L93 Difference]: Finished difference Result 180 states and 257 transitions. [2024-11-18 13:01:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 13:01:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 13:01:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:52,901 INFO L225 Difference]: With dead ends: 180 [2024-11-18 13:01:52,901 INFO L226 Difference]: Without dead ends: 178 [2024-11-18 13:01:52,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=254, Unknown=18, NotChecked=0, Total=342 [2024-11-18 13:01:52,902 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 133 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:52,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 136 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:01:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-18 13:01:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2024-11-18 13:01:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4605263157894737) internal successors, (222), 152 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2024-11-18 13:01:52,922 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 20 [2024-11-18 13:01:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:52,922 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2024-11-18 13:01:52,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2024-11-18 13:01:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:01:52,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:52,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:52,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 13:01:53,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:53,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:53,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash 625127019, now seen corresponding path program 1 times [2024-11-18 13:01:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559070281] [2024-11-18 13:01:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559070281] [2024-11-18 13:01:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559070281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297009845] [2024-11-18 13:01:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:53,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:53,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:53,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 13:01:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:53,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-18 13:01:53,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:01:53,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:01:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:01:53,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:01:53,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 69 [2024-11-18 13:01:53,850 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:01:53,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-18 13:01:53,866 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:01:53,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-18 13:01:53,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-18 13:01:53,992 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 35 treesize of output 19 [2024-11-18 13:01:53,998 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 20 treesize of output 15 [2024-11-18 13:01:54,005 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 [2024-11-18 13:01:54,015 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 27 treesize of output 15 [2024-11-18 13:01:54,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-18 13:01:54,066 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 15 treesize of output 7 [2024-11-18 13:01:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:54,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:54,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_492) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) 21)) is different from false [2024-11-18 13:01:54,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2024-11-18 13:01:54,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,218 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 154 treesize of output 105 [2024-11-18 13:01:54,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2024-11-18 13:01:54,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2024-11-18 13:01:54,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,262 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 108 treesize of output 101 [2024-11-18 13:01:54,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2024-11-18 13:01:54,307 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 73 treesize of output 57 [2024-11-18 13:01:54,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2024-11-18 13:01:54,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:54,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-18 13:01:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-18 13:01:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297009845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:54,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2024-11-18 13:01:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640417180] [2024-11-18 13:01:54,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:54,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 13:01:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 13:01:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=196, Unknown=6, NotChecked=28, Total=272 [2024-11-18 13:01:54,606 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:55,124 INFO L93 Difference]: Finished difference Result 247 states and 357 transitions. [2024-11-18 13:01:55,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 13:01:55,125 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 13:01:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:55,126 INFO L225 Difference]: With dead ends: 247 [2024-11-18 13:01:55,126 INFO L226 Difference]: Without dead ends: 187 [2024-11-18 13:01:55,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=446, Unknown=7, NotChecked=44, Total=600 [2024-11-18 13:01:55,127 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 118 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:55,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 284 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 0 Unknown, 80 Unchecked, 0.3s Time] [2024-11-18 13:01:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-18 13:01:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2024-11-18 13:01:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 166 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 240 transitions. [2024-11-18 13:01:55,157 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 240 transitions. Word has length 20 [2024-11-18 13:01:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:55,157 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 240 transitions. [2024-11-18 13:01:55,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 240 transitions. [2024-11-18 13:01:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 13:01:55,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:55,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:55,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 13:01:55,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:55,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:55,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1427240287, now seen corresponding path program 1 times [2024-11-18 13:01:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:55,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084608317] [2024-11-18 13:01:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:01:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084608317] [2024-11-18 13:01:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084608317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805948036] [2024-11-18 13:01:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:55,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:55,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:55,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:55,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 13:01:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:55,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 13:01:55,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2024-11-18 13:01:55,893 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 15 treesize of output 7 [2024-11-18 13:01:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:01:55,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:56,117 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-18 13:01:56,117 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 88 treesize of output 68 [2024-11-18 13:01:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:01:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805948036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:56,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2024-11-18 13:01:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370423351] [2024-11-18 13:01:56,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 13:01:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 13:01:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:01:56,148 INFO L87 Difference]: Start difference. First operand 167 states and 240 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:56,410 INFO L93 Difference]: Finished difference Result 224 states and 322 transitions. [2024-11-18 13:01:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 13:01:56,411 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-18 13:01:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:56,412 INFO L225 Difference]: With dead ends: 224 [2024-11-18 13:01:56,413 INFO L226 Difference]: Without dead ends: 222 [2024-11-18 13:01:56,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-18 13:01:56,414 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:56,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 134 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:01:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-18 13:01:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 183. [2024-11-18 13:01:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.467032967032967) internal successors, (267), 182 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 267 transitions. [2024-11-18 13:01:56,444 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 267 transitions. Word has length 22 [2024-11-18 13:01:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:56,445 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 267 transitions. [2024-11-18 13:01:56,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:01:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 267 transitions. [2024-11-18 13:01:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:01:56,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:56,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:56,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 13:01:56,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:56,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:56,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1725952529, now seen corresponding path program 2 times [2024-11-18 13:01:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197106185] [2024-11-18 13:01:56,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:01:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:56,688 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:01:56,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:01:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197106185] [2024-11-18 13:01:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197106185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743300210] [2024-11-18 13:01:57,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:01:57,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:57,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:57,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:01:57,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 13:01:57,541 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:01:57,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:01:57,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-18 13:01:57,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:57,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:01:57,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:01:57,604 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:01:57,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:01:57,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:01:57,628 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:01:57,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:01:57,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-18 13:01:57,657 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:01:57,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:01:57,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:01:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:57,787 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-18 13:01:57,788 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 97 [2024-11-18 13:01:57,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-18 13:01:57,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 30 [2024-11-18 13:01:57,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:01:57,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-11-18 13:01:57,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:57,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 15 [2024-11-18 13:01:57,942 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 35 treesize of output 19 [2024-11-18 13:01:57,949 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 20 treesize of output 15 [2024-11-18 13:01:57,956 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 [2024-11-18 13:01:57,967 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 27 treesize of output 15 [2024-11-18 13:01:57,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-18 13:01:58,001 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 15 treesize of output 7 [2024-11-18 13:01:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:58,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:58,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_696) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2024-11-18 13:01:58,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_686) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_696) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_690) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_691) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_689) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_61|) 0)) (not (= v_ArrVal_686 (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 (select v_ArrVal_686 .cse1))))))) is different from false [2024-11-18 13:01:58,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2024-11-18 13:01:58,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,215 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 313 treesize of output 240 [2024-11-18 13:01:58,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4838 treesize of output 4840 [2024-11-18 13:01:58,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1342 treesize of output 1032 [2024-11-18 13:01:58,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,354 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 2664 treesize of output 2477 [2024-11-18 13:01:58,435 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 774 treesize of output 650 [2024-11-18 13:01:58,458 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 622 treesize of output 558 [2024-11-18 13:01:58,513 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 359 treesize of output 291 [2024-11-18 13:01:58,538 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 266 treesize of output 234 [2024-11-18 13:01:58,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 502 treesize of output 494 [2024-11-18 13:01:58,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:01:58,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 470 treesize of output 478 [2024-11-18 13:01:59,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-18 13:01:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-18 13:01:59,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-18 13:01:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-18 13:01:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743300210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:59,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 19 [2024-11-18 13:01:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139196125] [2024-11-18 13:01:59,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:59,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 13:01:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 13:01:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=228, Unknown=3, NotChecked=62, Total=342 [2024-11-18 13:01:59,891 INFO L87 Difference]: Start difference. First operand 183 states and 267 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:02:00,452 INFO L93 Difference]: Finished difference Result 272 states and 387 transitions. [2024-11-18 13:02:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 13:02:00,453 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 13:02:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:02:00,455 INFO L225 Difference]: With dead ends: 272 [2024-11-18 13:02:00,455 INFO L226 Difference]: Without dead ends: 270 [2024-11-18 13:02:00,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=615, Unknown=3, NotChecked=106, Total=870 [2024-11-18 13:02:00,457 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 228 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:02:00,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 286 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 302 Invalid, 0 Unknown, 246 Unchecked, 0.3s Time] [2024-11-18 13:02:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-18 13:02:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 197. [2024-11-18 13:02:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.469387755102041) internal successors, (288), 196 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2024-11-18 13:02:00,482 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 24 [2024-11-18 13:02:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:02:00,482 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2024-11-18 13:02:00,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2024-11-18 13:02:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:02:00,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:02:00,483 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:02:00,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 13:02:00,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 13:02:00,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:02:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:02:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1725950607, now seen corresponding path program 2 times [2024-11-18 13:02:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:02:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15117247] [2024-11-18 13:02:00,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:02:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:02:00,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:02:00,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:02:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:01,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:02:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15117247] [2024-11-18 13:02:01,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15117247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:02:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948496067] [2024-11-18 13:02:01,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:02:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:02:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:02:01,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:02:01,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 13:02:01,372 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:02:01,373 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:02:01,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-18 13:02:01,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:02:01,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:02:01,394 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 [2024-11-18 13:02:01,444 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-18 13:02:01,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-18 13:02:01,463 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:02:01,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:02:01,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:02:01,495 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:02:01,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:02:01,519 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:02:01,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:02:01,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-18 13:02:01,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-18 13:02:01,652 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-18 13:02:01,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 92 [2024-11-18 13:02:01,676 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2024-11-18 13:02:01,676 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 149 [2024-11-18 13:02:01,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:02:01,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 40 [2024-11-18 13:02:01,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:02:01,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 15 [2024-11-18 13:02:01,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:02:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 11 [2024-11-18 13:02:01,715 INFO L349 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2024-11-18 13:02:01,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2024-11-18 13:02:01,951 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 [2024-11-18 13:02:01,959 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 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-18 13:02:01,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:02:01,975 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:02:01,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 39 [2024-11-18 13:02:02,039 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:02:02,040 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2024-11-18 13:02:02,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-18 13:02:02,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-18 13:02:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:02,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:02:02,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_823 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |v_ULTIMATE.start_main_~p~0#1.base_71|)) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_821) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_823) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_818) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) 21) (not (= v_ArrVal_820 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 (select v_ArrVal_820 .cse2)))))))) is different from false [2024-11-18 13:02:02,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:02,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 97 [2024-11-18 13:02:02,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:02,399 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 918 treesize of output 707 [2024-11-18 13:02:02,416 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 236 treesize of output 232 [2024-11-18 13:02:02,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:02,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 353 [2024-11-18 13:02:02,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:02,468 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 2524 treesize of output 2469 [2024-11-18 13:02:02,489 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 174 treesize of output 166 [2024-11-18 13:02:02,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:02:02,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-18 13:02:02,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 116 [2024-11-18 13:02:02,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2024-11-18 13:02:06,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:06,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2024-11-18 13:02:13,546 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (.cse20 (< |c_ULTIMATE.start_main_~list~0#1.offset| 0)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse10 (forall ((v_arrayElimCell_132 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse95 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse94 (select .cse95 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse93 (store .cse95 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse93 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse93 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse93 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse94 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|)))))))) (.cse11 (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (let ((.cse91 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse92 (select .cse91 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse91 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse92 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse12 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse90 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse89 (select .cse90 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse88 (store .cse90 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse88 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse88 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse89 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< 20 (select v_ArrVal_820 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse13 (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse87 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse86 (select .cse87 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse85 (store .cse87 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse85 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse85 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse86 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse14 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int)) (let ((.cse84 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse83 (select .cse84 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse82 (store .cse84 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse82 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse82 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse83 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse15 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse81 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse80 (select .cse81 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse79 (store .cse81 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse79 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse79 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse79 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse80 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse16 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse78 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse77 (select .cse78 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse76 (store .cse78 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse77 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse76 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse76 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse76 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse77 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse17 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse74 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select .cse74 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select (store .cse74 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse75 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse18 (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) v_arrayElimCell_132) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|)))))))) (.cse19 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse73 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse72 (select .cse73 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse71 (store .cse73 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse71 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse71 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse72 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))))) .cse20)) (.cse28 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (let ((.cse69 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse70 (select .cse69 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse69 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse70 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))))) (.cse24 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse68 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse67 (select .cse68 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse66 (store .cse68 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse66 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse66 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse66 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse67 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))) (< 20 (select v_ArrVal_820 0)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse25 (forall ((v_arrayElimCell_132 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int)) (let ((.cse65 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse64 (select .cse65 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse63 (store .cse65 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse63 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse63 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse64 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|)))))))) (.cse26 (or .cse20 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse61 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select .cse61 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select (store .cse61 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse62 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))))))) (.cse21 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|))) .cse0)) (.cse27 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse59 (select .cse60 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse58 (store .cse60 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse58 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse58 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse59 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse30 (and (forall ((v_arrayElimCell_132 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse36 v_arrayElimCell_133) 0) 21) (< (select (select .cse36 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse37 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))))) (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) 0) 21) (< 20 (select v_ArrVal_820 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse40 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int)) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse41 (store .cse43 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse41 v_arrayElimCell_133) 0) 21) (< (select (select .cse41 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse42 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))) (< 20 (select v_ArrVal_820 0)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse44 (store .cse46 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse44 v_arrayElimCell_133) 0) 21) (< (select (select .cse44 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse44 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse45 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse47 (store .cse49 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse47 v_arrayElimCell_133) 0) 21) (< (select (select .cse47 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse48 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse51 (select .cse52 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse50 (store .cse52 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse50 v_arrayElimCell_133) 0) 21) (< (select (select .cse50 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse50 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse51 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse53 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) 0) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse54 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))))) .cse20) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse56 (select .cse57 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse55 (store .cse57 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse55 v_arrayElimCell_133) 0) 21) (< (select (select .cse55 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse56 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))))) .cse20))) (.cse29 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 1))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)))) (let ((.cse1 (select (store (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (+ (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select (store (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_134) v_arrayElimCell_137) 21)))))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_816 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimArr_24) v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |c_ULTIMATE.start_main_~list~0#1.base|))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)))) (let ((.cse6 (select (store (store .cse8 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse7 (store (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (+ (select .cse6 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (< (select (select .cse7 v_arrayElimCell_138) v_arrayElimCell_139) 21) (not (= (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select .cse7 v_arrayElimCell_134) v_arrayElimCell_137) 21)))))) .cse0) (or .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (or .cse20 (and .cse21 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int)) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse22 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (+ (select .cse23 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))))))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))))) .cse24 .cse25 .cse26 .cse27 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_132 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) v_arrayElimCell_132) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) .cse20) (or .cse20 .cse28 .cse29))) (or .cse9 .cse30) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)))) (let ((.cse31 (select (store (store .cse33 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse32 (store (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (+ (select .cse31 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (< (select (select .cse32 v_arrayElimCell_138) v_arrayElimCell_139) 21) (not (= (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select .cse32 v_arrayElimCell_134) v_arrayElimCell_137) 21)))))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)))) (let ((.cse34 (select (store (store .cse35 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (+ (select .cse34 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select (store (store .cse35 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_134) v_arrayElimCell_137) 21))))) .cse0) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (or .cse20 .cse28) .cse24 .cse25 .cse26 (or .cse20 (and (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse4 .cse5 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) v_arrayElimCell_132) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) .cse21)) .cse27) .cse29) (or .cse30 .cse29) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (not (= (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0))) .cse20 .cse0)))) is different from true [2024-11-18 13:02:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-18 13:02:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948496067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:02:20,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:02:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-18 13:02:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135691983] [2024-11-18 13:02:20,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:02:20,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 13:02:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:02:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 13:02:20,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=279, Unknown=2, NotChecked=70, Total=420 [2024-11-18 13:02:20,816 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:24,907 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (not (= .cse0 0))) (.cse22 (< |c_ULTIMATE.start_main_~list~0#1.offset| 0)) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse11 (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse12 (forall ((v_arrayElimCell_132 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse96 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse95 (select .cse96 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse94 (store .cse96 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse95 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse94 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse94 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse94 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse95 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|)))))))) (.cse13 (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (let ((.cse92 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse92 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse93 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse14 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse91 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse90 (select .cse91 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse89 (store .cse91 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse89 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse89 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse90 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< 20 (select v_ArrVal_820 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse15 (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse88 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse87 (select .cse88 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse86 (store .cse88 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse87 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse86 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse86 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse87 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse16 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int)) (let ((.cse85 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse84 (select .cse85 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse83 (store .cse85 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse83 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse83 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse84 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse17 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse82 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse81 (select .cse82 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse80 (store .cse82 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse80 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse80 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse80 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse81 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse18 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse79 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse78 (select .cse79 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse77 (store .cse79 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse77 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse77 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse77 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse78 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse19 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse75 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select .cse75 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select (store .cse75 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse76 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse20 (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) v_arrayElimCell_132) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|)))))))) (.cse21 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse74 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse73 (select .cse74 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse72 (store .cse74 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse72 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse72 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse73 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))))) .cse22)) (.cse30 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (let ((.cse70 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse70 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse71 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))))) (.cse26 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse69 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse68 (select .cse69 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse67 (store .cse69 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse67 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse67 v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (select (select .cse67 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse68 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))) (< 20 (select v_ArrVal_820 0)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse27 (forall ((v_arrayElimCell_132 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int)) (let ((.cse66 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse65 (select .cse66 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse64 (store .cse66 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse64 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse64 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse65 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|)))))))) (.cse28 (or .cse22 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select .cse62 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select (store .cse62 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse63 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))))))) (.cse23 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|))) .cse1)) (.cse29 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse60 (select .cse61 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse59 (store .cse61 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse59 v_arrayElimCell_132) v_arrayElimCell_136) 21) (< (select (select .cse59 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse60 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))) (.cse31 (and (forall ((v_arrayElimCell_132 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_132) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse37 v_arrayElimCell_133) 0) 21) (< (select (select .cse37 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse38 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))))) (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse40 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) 0) 21) (< 20 (select v_ArrVal_820 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse41 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int)) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse42 (store .cse44 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse42 v_arrayElimCell_133) 0) 21) (< (select (select .cse42 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse43 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))) (< 20 (select v_ArrVal_820 0)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse46 (select .cse47 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse45 (store .cse47 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse45 v_arrayElimCell_133) 0) 21) (< (select (select .cse45 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse45 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse46 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_132) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse48 (store .cse50 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse48 v_arrayElimCell_133) 0) 21) (< (select (select .cse48 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse49 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse52 (select .cse53 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse51 (store .cse53 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse51 v_arrayElimCell_133) 0) 21) (< (select (select .cse51 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< (select (select .cse51 v_arrayElimCell_134) v_arrayElimCell_137) 21) (< (+ (select .cse52 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828)))))))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse54 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) 0) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse55 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))))) .cse22) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse56 (store .cse58 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (select (select .cse56 v_arrayElimCell_133) 0) 21) (< (select (select .cse56 v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (< (+ (select .cse57 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (not (= (select |c_#valid| v_arrayElimCell_132) 0))))))) .cse22))) (.cse10 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse3 (store |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base| 1))) (and (= .cse0 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0) 10) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or .cse1 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)))) (let ((.cse2 (select (store (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (not (= (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select (store (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_134) v_arrayElimCell_137) 21)))))) (forall ((v_arrayElimCell_132 Int)) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_816 Int) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimArr_24) v_arrayElimCell_138) v_arrayElimCell_139) 21) (< 20 (select v_ArrVal_820 0)))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |c_ULTIMATE.start_main_~list~0#1.base|))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)))) (let ((.cse7 (select (store (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse8 (store (store .cse9 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (+ (select .cse7 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (< (select (select .cse8 v_arrayElimCell_138) v_arrayElimCell_139) 21) (not (= (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select .cse8 v_arrayElimCell_134) v_arrayElimCell_137) 21)))))) .cse1) .cse10 (or .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (or .cse22 (and .cse23 (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_136 Int)) (or (< 20 (select v_ArrVal_820 0)) (forall ((v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (or (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (forall ((v_ArrVal_828 Int) (v_ArrVal_816 Int)) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (select (select (store .cse24 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_133) v_arrayElimCell_136) 21) (< (+ (select .cse25 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828))))))))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))))) .cse26 .cse27 .cse28 .cse29 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_arrayElimCell_132 Int) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) v_arrayElimCell_132) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) .cse22) (or .cse22 .cse30 .cse10))) (or .cse11 .cse31) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_139 Int) (v_arrayElimCell_138 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)))) (let ((.cse32 (select (store (store .cse34 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse33 (store (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)))) (or (< (+ (select .cse32 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21) (< (select (select .cse33 v_arrayElimCell_138) v_arrayElimCell_139) 21) (not (= (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select .cse33 v_arrayElimCell_134) v_arrayElimCell_137) 21)))))) .cse1) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_816 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)))) (let ((.cse35 (select (store (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base|))) (or (< (+ (select .cse35 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) v_ArrVal_828) (< 20 (select v_ArrVal_820 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0)) (< (select (select (store (store .cse36 |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) |c_ULTIMATE.start_main_~list~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_828)) v_arrayElimCell_134) v_arrayElimCell_137) 21))))) .cse1) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (or .cse22 .cse30) .cse26 .cse27 .cse28 (or .cse22 (and (forall ((v_arrayElimCell_132 Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select (store |c_#valid| v_arrayElimCell_132 1) |v_ULTIMATE.start_main_~p~0#1.base_71|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_816 Int) (v_arrayElimCell_137 Int) (v_ArrVal_819 (Array Int Int)) (v_arrayElimCell_136 Int)) (or (< (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse5 .cse6 v_ArrVal_816)) v_arrayElimCell_132 v_ArrVal_820) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_819) v_arrayElimCell_132) v_arrayElimCell_136) 21) (< 20 (select v_ArrVal_820 0)) (< (select v_ArrVal_819 v_arrayElimCell_137) 21))))) (not (= (select |c_#valid| v_arrayElimCell_132) 0)))) .cse23)) .cse29) .cse10) (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0) (or .cse31 .cse10) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (not (= (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0))) .cse22 .cse1))))) is different from true [2024-11-18 13:02:29,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:02:33,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:02:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:02:33,839 INFO L93 Difference]: Finished difference Result 381 states and 558 transitions. [2024-11-18 13:02:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 13:02:33,840 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 13:02:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:02:33,842 INFO L225 Difference]: With dead ends: 381 [2024-11-18 13:02:33,842 INFO L226 Difference]: Without dead ends: 302 [2024-11-18 13:02:33,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=223, Invalid=778, Unknown=3, NotChecked=186, Total=1190 [2024-11-18 13:02:33,844 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 62 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:02:33,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 297 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 404 Invalid, 2 Unknown, 273 Unchecked, 8.5s Time] [2024-11-18 13:02:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-18 13:02:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 237. [2024-11-18 13:02:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.4576271186440677) internal successors, (344), 236 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 344 transitions. [2024-11-18 13:02:33,876 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 344 transitions. Word has length 24 [2024-11-18 13:02:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:02:33,876 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 344 transitions. [2024-11-18 13:02:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 344 transitions. [2024-11-18 13:02:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:02:33,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:02:33,877 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:02:33,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 13:02:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:02:34,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:02:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:02:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468414, now seen corresponding path program 1 times [2024-11-18 13:02:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:02:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907459589] [2024-11-18 13:02:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:02:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:02:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:02:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:34,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:02:34,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907459589] [2024-11-18 13:02:34,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907459589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:02:34,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858495330] [2024-11-18 13:02:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:02:34,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:02:34,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:02:34,423 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:02:34,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 13:02:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:02:34,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 13:02:34,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:02:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:02:34,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-18 13:02:34,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-18 13:02:34,795 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 15 treesize of output 7 [2024-11-18 13:02:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:34,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:02:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:35,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858495330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:02:35,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:02:35,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-11-18 13:02:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419132873] [2024-11-18 13:02:35,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:02:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 13:02:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:02:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 13:02:35,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2024-11-18 13:02:35,019 INFO L87 Difference]: Start difference. First operand 237 states and 344 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:02:35,459 INFO L93 Difference]: Finished difference Result 307 states and 437 transitions. [2024-11-18 13:02:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 13:02:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 13:02:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:02:35,461 INFO L225 Difference]: With dead ends: 307 [2024-11-18 13:02:35,461 INFO L226 Difference]: Without dead ends: 296 [2024-11-18 13:02:35,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=477, Invalid=1005, Unknown=0, NotChecked=0, Total=1482 [2024-11-18 13:02:35,464 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 70 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:02:35,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 108 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:02:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-18 13:02:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 277. [2024-11-18 13:02:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4275362318840579) internal successors, (394), 276 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 394 transitions. [2024-11-18 13:02:35,514 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 394 transitions. Word has length 26 [2024-11-18 13:02:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:02:35,515 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 394 transitions. [2024-11-18 13:02:35,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:02:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 394 transitions. [2024-11-18 13:02:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:02:35,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:02:35,516 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:02:35,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-18 13:02:35,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 13:02:35,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:02:35,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:02:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash 589687314, now seen corresponding path program 3 times [2024-11-18 13:02:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:02:35,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372380005] [2024-11-18 13:02:35,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:02:35,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:02:35,756 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:02:35,760 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:02:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:02:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372380005] [2024-11-18 13:02:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372380005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:02:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776307433] [2024-11-18 13:02:36,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:02:36,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:02:36,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:02:36,325 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:02:36,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 13:02:36,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:02:36,485 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:02:36,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-18 13:02:36,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:02:36,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-18 13:02:36,550 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:02:36,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-18 13:02:36,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 11 [2024-11-18 13:02:36,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 19 [2024-11-18 13:02:36,710 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:02:36,710 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2024-11-18 13:02:36,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-18 13:02:36,833 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:02:36,834 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2024-11-18 13:02:36,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-18 13:02:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:02:36,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:02:36,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_975 Int)) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~p~0#1.offset| v_ArrVal_975)) .cse1) (+ (select .cse2 .cse3) 4)) 0)) (forall ((v_ArrVal_973 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_973) .cse1) (+ 4 (select v_ArrVal_973 .cse3))) 0) (not (= v_ArrVal_973 (store .cse2 |c_ULTIMATE.start_main_~p~0#1.offset| (select v_ArrVal_973 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) is different from false [2024-11-18 13:02:37,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (forall ((v_ArrVal_975 Int)) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_975)) .cse1) (+ (select .cse2 .cse3) 4)) 0)) (forall ((v_ArrVal_973 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_973) .cse1) (+ (select v_ArrVal_973 .cse3) 4)) 0) (not (= v_ArrVal_973 (store .cse2 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_973 |c_ULTIMATE.start_main_~list~0#1.offset|))))))))) is different from false [2024-11-18 13:02:37,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:37,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 44789 treesize of output 43082 [2024-11-18 13:02:37,865 INFO L349 Elim1Store]: treesize reduction 80, result has 47.7 percent of original size [2024-11-18 13:02:37,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 4438 treesize of output 3368 [2024-11-18 13:02:38,665 INFO L349 Elim1Store]: treesize reduction 484, result has 19.9 percent of original size [2024-11-18 13:02:38,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 32 case distinctions, treesize of input 4943 treesize of output 4865 [2024-11-18 13:02:39,202 INFO L349 Elim1Store]: treesize reduction 204, result has 16.0 percent of original size [2024-11-18 13:02:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 4101 treesize of output 4126 [2024-11-18 13:02:39,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:39,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 8188 treesize of output 8216