./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 93b4a0ba0c9f7effb12d2a47608c061d55502e7c43d58dada73542f7a20a21c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:21:32,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:21:32,981 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-64bit-Taipan_Default.epf [2024-11-09 01:21:32,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:21:32,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:21:33,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:21:33,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:21:33,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:21:33,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:21:33,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:21:33,019 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:21:33,019 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:21:33,020 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:21:33,020 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:21:33,021 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:21:33,021 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:21:33,022 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:21:33,022 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:21:33,023 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:21:33,023 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:21:33,024 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:21:33,025 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:21:33,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:21:33,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:21:33,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:21:33,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:21:33,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:21:33,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:21:33,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:21:33,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:21:33,029 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 01:21:33,030 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:21:33,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:21:33,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:21:33,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:21:33,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:21:33,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:21:33,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:21:33,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:21:33,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:21:33,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:21:33,034 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:21:33,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:21:33,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:21:33,035 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:21:33,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:21:33,036 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93b4a0ba0c9f7effb12d2a47608c061d55502e7c43d58dada73542f7a20a21c1 [2024-11-09 01:21:33,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:21:33,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:21:33,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:21:33,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:21:33,390 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:21:33,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i Unable to find full path for "g++" [2024-11-09 01:21:35,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:21:35,911 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:21:35,912 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2024-11-09 01:21:35,929 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/data/ad52c4780/9f7734b77e484bb893d2adc720c644c9/FLAGdab4db110 [2024-11-09 01:21:35,944 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/data/ad52c4780/9f7734b77e484bb893d2adc720c644c9 [2024-11-09 01:21:35,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:21:35,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:21:35,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:35,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:21:35,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:21:35,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:35" (1/1) ... [2024-11-09 01:21:35,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541bc15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:35, skipping insertion in model container [2024-11-09 01:21:35,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:21:35" (1/1) ... [2024-11-09 01:21:36,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:21:36,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:36,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:21:36,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:21:36,611 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:21:36,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36 WrapperNode [2024-11-09 01:21:36,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:21:36,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:36,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:21:36,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:21:36,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,676 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-09 01:21:36,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:21:36,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:21:36,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:21:36,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:21:36,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:21:36,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:21:36,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:21:36,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:21:36,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (1/1) ... [2024-11-09 01:21:36,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:21:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:21:36,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:21:36,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:21:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:21:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:21:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:21:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:21:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:21:36,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:21:36,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:21:36,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:21:37,214 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-09 01:21:37,215 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:21:37,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:21:37,299 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:21:37,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:37 BoogieIcfgContainer [2024-11-09 01:21:37,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:21:37,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:21:37,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:21:37,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:21:37,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:21:35" (1/3) ... [2024-11-09 01:21:37,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e612727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:37, skipping insertion in model container [2024-11-09 01:21:37,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:21:36" (2/3) ... [2024-11-09 01:21:37,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e612727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:21:37, skipping insertion in model container [2024-11-09 01:21:37,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:37" (3/3) ... [2024-11-09 01:21:37,310 INFO L112 eAbstractionObserver]: Analyzing ICFG c.07-alloca.i [2024-11-09 01:21:37,332 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:21:37,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 01:21:37,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:21:37,416 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=FINITE_AUTOMATA, 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;@561d9c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:21:37,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 01:21:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.75) internal successors, (14), 12 states have internal predecessors, (14), 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-09 01:21:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 01:21:37,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:37,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 01:21:37,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 01:21:37,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2253353, now seen corresponding path program 1 times [2024-11-09 01:21:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:37,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760003468] [2024-11-09 01:21:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:37,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:38,982 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-09 01:21:38,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760003468] [2024-11-09 01:21:38,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760003468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:38,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:21:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91108017] [2024-11-09 01:21:38,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:21:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:39,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:21:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:21:39,032 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.75) internal successors, (14), 12 states have internal predecessors, (14), 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 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-09 01:21:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:39,178 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-09 01:21:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:21:39,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-09 01:21:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:39,190 INFO L225 Difference]: With dead ends: 20 [2024-11-09 01:21:39,190 INFO L226 Difference]: Without dead ends: 14 [2024-11-09 01:21:39,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:39,198 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:39,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:21:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-09 01:21:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 01:21:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 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-09 01:21:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-09 01:21:39,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2024-11-09 01:21:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-09 01:21:39,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-09 01:21:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-09 01:21:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:21:39,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:39,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:21:39,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:21:39,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 01:21:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 69854001, now seen corresponding path program 1 times [2024-11-09 01:21:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026847169] [2024-11-09 01:21:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:39,532 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-09 01:21:39,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:39,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026847169] [2024-11-09 01:21:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026847169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:21:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967422063] [2024-11-09 01:21:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:39,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:21:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:21:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:21:39,536 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-09 01:21:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:39,581 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-09 01:21:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:21:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-09 01:21:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:39,583 INFO L225 Difference]: With dead ends: 14 [2024-11-09 01:21:39,583 INFO L226 Difference]: Without dead ends: 13 [2024-11-09 01:21:39,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:39,585 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:39,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:21:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-09 01:21:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 01:21:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 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-09 01:21:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-09 01:21:39,590 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2024-11-09 01:21:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:39,591 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-09 01:21:39,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-09 01:21:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-09 01:21:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 01:21:39,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:39,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 01:21:39,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:21:39,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 01:21:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2129493205, now seen corresponding path program 1 times [2024-11-09 01:21:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472867082] [2024-11-09 01:21:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:40,103 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-09 01:21:40,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:40,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472867082] [2024-11-09 01:21:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472867082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:40,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:21:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344608602] [2024-11-09 01:21:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:40,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:21:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:21:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:40,107 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-09 01:21:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:40,238 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-09 01:21:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:21:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2024-11-09 01:21:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:40,241 INFO L225 Difference]: With dead ends: 13 [2024-11-09 01:21:40,241 INFO L226 Difference]: Without dead ends: 12 [2024-11-09 01:21:40,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:21:40,243 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:40,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:21:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-09 01:21:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 01:21:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 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-09 01:21:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-09 01:21:40,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2024-11-09 01:21:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:40,253 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-09 01:21:40,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-09 01:21:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-09 01:21:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:21:40,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:40,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:40,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:21:40,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 01:21:40,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1589779853, now seen corresponding path program 1 times [2024-11-09 01:21:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804275853] [2024-11-09 01:21:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:40,718 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-09 01:21:40,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804275853] [2024-11-09 01:21:40,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804275853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:21:40,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:21:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:21:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130106397] [2024-11-09 01:21:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:21:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:21:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:21:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:21:40,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:21:40,725 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-09 01:21:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:40,780 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-09 01:21:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:21:40,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-09 01:21:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:40,782 INFO L225 Difference]: With dead ends: 12 [2024-11-09 01:21:40,782 INFO L226 Difference]: Without dead ends: 11 [2024-11-09 01:21:40,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:21:40,784 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:40,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:21:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-09 01:21:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-09 01:21:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-09 01:21:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-09 01:21:40,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-11-09 01:21:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:40,796 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-09 01:21:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-09 01:21:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-09 01:21:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:21:40,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:40,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:40,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:21:40,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 01:21:40,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -527149121, now seen corresponding path program 1 times [2024-11-09 01:21:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:40,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018632118] [2024-11-09 01:21:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:41,659 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-09 01:21:41,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:21:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018632118] [2024-11-09 01:21:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018632118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:21:41,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823829548] [2024-11-09 01:21:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:41,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:41,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:21:41,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:21:41,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:21:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:21:41,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 01:21:41,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:21:41,946 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 01:21:41,946 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 23 treesize of output 19 [2024-11-09 01:21:41,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:21:43,946 INFO L349 Elim1Store]: treesize reduction 535, result has 31.8 percent of original size [2024-11-09 01:21:43,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 5158 treesize of output 2243 [2024-11-09 01:21:44,198 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 12 treesize of output 11 [2024-11-09 01:21:44,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:44,289 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 12 treesize of output 1 [2024-11-09 01:21:44,860 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 12 treesize of output 11 [2024-11-09 01:21:44,909 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 12 treesize of output 11 [2024-11-09 01:21:45,298 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 12 treesize of output 11 [2024-11-09 01:21:45,395 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 12 treesize of output 11 [2024-11-09 01:21:45,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:45,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:46,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:46,116 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:46,116 INFO L224 Elim1Store]: Index analysis took 418 ms [2024-11-09 01:21:46,284 INFO L349 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2024-11-09 01:21:46,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 27 case distinctions, treesize of input 273 treesize of output 345 [2024-11-09 01:21:47,799 INFO L224 Elim1Store]: Index analysis took 657 ms [2024-11-09 01:21:48,187 INFO L349 Elim1Store]: treesize reduction 252, result has 14.0 percent of original size [2024-11-09 01:21:48,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 37 case distinctions, treesize of input 329 treesize of output 415 [2024-11-09 01:21:49,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:21:49,919 INFO L224 Elim1Store]: Index analysis took 228 ms [2024-11-09 01:21:49,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 293 [2024-11-09 01:22:08,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18618 treesize of output 18463 [2024-11-09 01:22:18,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:22:18,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:22:18,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:22:18,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:22:19,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:22:20,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:20,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:20,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:20,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:20,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:20,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:21,220 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:21,329 INFO L349 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2024-11-09 01:22:21,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 5778 treesize of output 5597 [2024-11-09 01:22:23,907 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 9 treesize of output 7 [2024-11-09 01:22:24,537 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 9 treesize of output 7 [2024-11-09 01:22:24,552 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 9 treesize of output 7 [2024-11-09 01:22:24,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:24,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:24,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:24,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:24,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:24,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:24,823 INFO L349 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2024-11-09 01:22:24,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1284 treesize of output 1245 [2024-11-09 01:22:24,972 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 9 treesize of output 7 [2024-11-09 01:22:25,036 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 9 treesize of output 7 [2024-11-09 01:22:25,196 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 9 treesize of output 7 [2024-11-09 01:22:25,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:25,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:25,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:25,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:25,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:25,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:25,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:25,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 71 [2024-11-09 01:22:25,267 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 9 treesize of output 7 [2024-11-09 01:22:26,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:26,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:26,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:26,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:26,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:26,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:22:26,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:26,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:26,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:22:26,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 88 [2024-11-09 01:22:26,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 01:22:28,096 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-09 01:22:28,175 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-09 01:22:28,861 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-09 01:22:30,548 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-09 01:23:18,121 WARN L286 SmtUtils]: Spent 32.05s on a formula simplification. DAG size of input: 873 DAG size of output: 873 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:23:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:23:23,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:23:23,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:23:40,469 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 726 DAG size of output: 156 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 01:23:40,470 INFO L349 Elim1Store]: treesize reduction 1323, result has 17.8 percent of original size [2024-11-09 01:23:40,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 3 disjoint index pairs (out of 153 index pairs), introduced 19 new quantified variables, introduced 167 case distinctions, treesize of input 225514 treesize of output 206221 [2024-11-09 01:23:45,647 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 12559 DAG size of output: 4218 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:23:47,515 INFO L224 Elim1Store]: Index analysis took 259 ms [2024-11-09 01:23:50,936 INFO L349 Elim1Store]: treesize reduction 1343, result has 15.6 percent of original size [2024-11-09 01:23:50,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 3 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 165 case distinctions, treesize of input 27535 treesize of output 27263 [2024-11-09 01:24:11,234 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 7 treesize of output 5 [2024-11-09 01:24:13,424 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 01:24:13,777 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 01:24:19,155 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 7 treesize of output 5 [2024-11-09 01:27:05,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2024-11-09 01:27:07,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-09 01:27:07,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 01:27:07,824 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 18 treesize of output 1 [2024-11-09 01:27:07,835 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 18 treesize of output 1 [2024-11-09 01:27:07,852 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 10 treesize of output 1 [2024-11-09 01:27:07,878 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 18 treesize of output 1 [2024-11-09 01:27:07,889 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 18 treesize of output 1 [2024-11-09 01:27:07,906 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 62 treesize of output 1 [2024-11-09 01:27:07,928 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 18 treesize of output 1 [2024-11-09 01:27:07,939 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 18 treesize of output 1 [2024-11-09 01:27:07,975 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 18 treesize of output 1 [2024-11-09 01:27:08,009 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 18 treesize of output 1 [2024-11-09 01:27:08,058 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 18 treesize of output 1 [2024-11-09 01:27:08,114 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 18 treesize of output 1 [2024-11-09 01:27:08,136 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 18 treesize of output 1 [2024-11-09 01:27:08,170 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 18 treesize of output 1 [2024-11-09 01:27:08,216 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 18 treesize of output 1 [2024-11-09 01:27:08,231 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 10 treesize of output 1 [2024-11-09 01:27:08,257 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 10 treesize of output 1 [2024-11-09 01:27:10,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 110 [2024-11-09 01:27:14,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:27:14,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-09 01:27:14,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-11-09 01:27:15,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 01:27:15,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 01:27:15,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 01:27:15,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 01:27:15,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 01:27:15,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-11-09 01:27:20,267 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2024-11-09 01:27:20,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 53 [2024-11-09 01:27:23,567 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-09 01:27:23,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 56 [2024-11-09 01:27:26,323 INFO L349 Elim1Store]: treesize reduction 114, result has 46.5 percent of original size [2024-11-09 01:27:26,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 187 treesize of output 198 [2024-11-09 01:27:26,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:26,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 126 [2024-11-09 01:27:29,866 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-09 01:27:29,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:39,873 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-09 01:27:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823829548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [237867730] [2024-11-09 01:27:39,931 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2024-11-09 01:27:39,931 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:39,939 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:39,950 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:39,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:41,531 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:28:00,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '249#(and (= |ULTIMATE.start_test_fun_~k_ref~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (<= 2 |ULTIMATE.start_test_fun_~k_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 2 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc6#1.base|) (<= 2 |ULTIMATE.start_test_fun_~i_ref~0#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~k#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~k#1| 2147483647) (<= 2 |ULTIMATE.start_test_fun_~j_ref~0#1.base|))' at error location [2024-11-09 01:28:00,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:28:00,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:00,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2024-11-09 01:28:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304475784] [2024-11-09 01:28:00,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:28:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:28:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=431, Unknown=17, NotChecked=0, Total=552 [2024-11-09 01:28:00,131 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-09 01:28:02,222 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse42 (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse3 (select .cse19 0)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse2 (not .cse7)) (.cse4 (select .cse18 0)) (.cse9 (<= 0 (+ .cse3 2147483648))) (.cse8 (select .cse0 0)) (.cse6 (not .cse42))) (and (<= 0 (+ (select .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|) 2147483648)) (let ((.cse5 (<= 0 (+ .cse8 2147483648))) (.cse1 (exists ((|ULTIMATE.start_test_fun_~k_ref~0#1.base| Int)) (and (not (= |ULTIMATE.start_test_fun_~k_ref~0#1.base| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~k_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (<= 0 (+ (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~k_ref~0#1.base|) 0) 2147483648)))))) (or (and .cse1 .cse2 (<= .cse3 (+ .cse4 1)) .cse5) (and .cse2 .cse5 (<= 0 (+ .cse4 2147483648)) .cse6) (and .cse7 .cse1 (<= .cse3 (+ .cse8 1))))) .cse2 (= |c_ULTIMATE.start_test_fun_~k_ref~0#1.offset| 0) .cse9 (not (= |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (let ((.cse35 (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (.cse158 (or (< 0 (+ 2147483649 .cse3)) .cse7))) (or (and .cse9 (<= 0 .cse4)) (and .cse9 (or (and .cse7 (or (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse10 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (<= 0 .cse10) (exists ((v_prenex_650 (Array Int Int)) (v_prenex_630 (Array Int Int)) (v_prenex_601 (Array Int Int)) (v_prenex_602 (Array Int Int)) (v_prenex_636 (Array Int Int)) (v_prenex_603 (Array Int Int)) (v_prenex_637 (Array Int Int)) (v_prenex_604 (Array Int Int)) (v_prenex_648 (Array Int Int)) (v_prenex_638 (Array Int Int)) (v_prenex_605 (Array Int Int)) (v_prenex_649 (Array Int Int)) (v_prenex_639 (Array Int Int))) (let ((.cse11 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_605) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_602) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_603) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_604) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_601))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse14 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_636) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_637) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_638) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_639) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 0 .cse10)))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse15 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_630) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_648) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_649) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_650) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 0 .cse10)))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= (select .cse11 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse12) (= .cse13 (select .cse14 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse12 (select .cse14 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= v_prenex_648 (select .cse15 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse16 (select .cse15 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (store .cse12 0 .cse10) v_prenex_601) (= .cse12 .cse0) (= .cse16 (select .cse11 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse16 .cse17) (= .cse13 (select .cse15 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse18 .cse13) (= (select .cse14 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_637) (= v_prenex_602 (select .cse11 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))))))))))))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse24 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (exists ((v_prenex_634 (Array Int Int)) (v_prenex_635 (Array Int Int)) (v_prenex_647 (Array Int Int)) (v_prenex_625 (Array Int Int)) (v_prenex_615 (Array Int Int)) (v_prenex_626 (Array Int Int)) (v_prenex_616 (Array Int Int)) (v_prenex_627 (Array Int Int)) (v_prenex_617 (Array Int Int)) (v_prenex_628 (Array Int Int)) (v_prenex_618 (Array Int Int)) (v_prenex_629 (Array Int Int)) (v_prenex_619 (Array Int Int))) (let ((.cse26 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_619) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_616) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_617) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_618) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_615))) (let ((.cse28 (select .cse26 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse23 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_647) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_629) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_628) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_627) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse28 0 .cse24)))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse25 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_634) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_635) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_625) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_626) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 0 .cse24)))) (let ((.cse22 (select .cse25 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse27 (select .cse26 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse20 (select .cse23 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (and (= .cse19 .cse20) (= .cse17 .cse21) (= .cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (store .cse22 0 .cse24) v_prenex_615) (= .cse21 (select .cse25 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse22 (select .cse26 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse21 (select .cse26 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse22 .cse0) (= v_prenex_635 (select .cse25 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse19 .cse27) (= v_prenex_616 .cse27) (= (select .cse25 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse28) (= .cse20 v_prenex_629))))))))) (<= 0 .cse24)))))) (and (exists ((v_prenex_382 (Array Int Int)) (v_prenex_383 (Array Int Int)) (v_prenex_384 (Array Int Int)) (v_prenex_385 (Array Int Int)) (v_prenex_660 (Array Int Int)) (v_prenex_661 (Array Int Int)) (v_prenex_657 (Array Int Int)) (v_prenex_659 (Array Int Int)) (v_prenex_76 (Array Int Int)) (v_prenex_75 (Array Int Int)) (v_prenex_74 (Array Int Int)) (v_prenex_73 (Array Int Int)) (|ULTIMATE.start_test_fun_~c~0#1.base| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse32 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_382) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_383) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_384) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_385) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_25))) (let ((.cse30 (select .cse32 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse34 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (let ((.cse33 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_661) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_657) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_659) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_660) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse30 0 .cse34)))) (let ((.cse29 (select .cse33 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse31 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_73) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_74) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_75) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_76) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 0 .cse34)))) (and (= .cse29 .cse18) (= .cse30 (select .cse31 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse19 (select .cse32 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse31 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) v_prenex_75) (= .cse19 (select .cse33 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse32 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) v_prenex_384) (= .cse30 .cse0) (= (select .cse33 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse30) (= .cse34 (select v_DerPreprocessor_25 0)) (= v_prenex_659 (select .cse33 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (<= 0 .cse34) (= .cse29 (select .cse32 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse19 (select .cse31 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse29 (select .cse31 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))))))))) .cse35) (and (exists ((v_prenex_362 (Array Int Int)) (v_prenex_363 (Array Int Int)) (v_prenex_364 (Array Int Int)) (v_prenex_365 (Array Int Int)) (v_prenex_646 (Array Int Int)) (v_prenex_606 (Array Int Int)) (v_prenex_65 (Array Int Int)) (v_prenex_607 (Array Int Int)) (v_prenex_608 (Array Int Int)) (v_prenex_609 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_prenex_66 (Array Int Int)) (|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse41 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_609) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_606) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_607) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_608) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_646))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (.cse40 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (let ((.cse38 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_65) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_68) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse37 0 .cse40)))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse36 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_362) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_363) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_364) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_365) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse39 0 .cse40)))) (and (= .cse19 (select .cse36 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse36 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse37) (not (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= v_prenex_362 (select .cse36 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse37 (select .cse38 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse36 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse39) (= .cse19 (select .cse38 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse40 (select v_prenex_646 0)) (= .cse17 .cse39) (= .cse37 .cse18) (<= 0 .cse40) (= (select .cse41 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse39) (= .cse19 (select .cse41 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= v_prenex_65 (select .cse38 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= v_prenex_609 (select .cse41 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))))))))) .cse42) (and .cse7 (exists ((v_prenex_651 (Array Int Int)) (v_prenex_640 (Array Int Int)) (v_prenex_652 (Array Int Int)) (v_prenex_641 (Array Int Int)) (v_prenex_620 (Array Int Int)) (v_prenex_653 (Array Int Int)) (v_prenex_621 (Array Int Int)) (v_prenex_654 (Array Int Int)) (v_prenex_622 (Array Int Int)) (v_prenex_655 (Array Int Int)) (v_prenex_623 (Array Int Int)) (v_prenex_656 (Array Int Int)) (v_prenex_624 (Array Int Int)) (|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse50 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_624) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_621) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_622) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_623) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_620))) (let ((.cse48 (select .cse50 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (.cse49 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (let ((.cse46 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_652) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_654) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_656) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_641) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse48 0 .cse49)))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse44 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_651) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_653) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_655) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_640) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse43 0 .cse49)))) (let ((.cse47 (select .cse44 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse51 (select .cse50 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse45 (select .cse44 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= .cse17 .cse43) (= .cse43 (select .cse44 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse45 (select .cse46 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse47 .cse19) (= (select .cse46 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_654) (= .cse45 .cse0) (= .cse48 (select .cse46 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (<= 0 .cse49) (= (select .cse50 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse45) (= .cse47 v_prenex_653) (= .cse19 .cse51) (= v_prenex_621 .cse51) (= .cse43 (select .cse50 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (store .cse45 0 .cse49) v_prenex_620)))))))))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse52 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 0 .cse52) (exists ((v_prenex_642 (Array Int Int)) (v_prenex_631 (Array Int Int)) (v_prenex_643 (Array Int Int)) (v_prenex_632 (Array Int Int)) (v_prenex_610 (Array Int Int)) (v_prenex_644 (Array Int Int)) (v_prenex_633 (Array Int Int)) (v_prenex_611 (Array Int Int)) (v_prenex_645 (Array Int Int)) (v_prenex_612 (Array Int Int)) (v_prenex_613 (Array Int Int)) (v_prenex_614 (Array Int Int)) (v_prenex_658 (Array Int Int))) (let ((.cse65 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_614) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_611) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_612) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_613) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_610))) (let ((.cse54 (select .cse65 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse60 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_658) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_633) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_632) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_631) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse54 0 .cse52)))) (let ((.cse56 (select .cse60 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse55 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_642) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_643) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_644) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_645) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse56 0 .cse52)))) (let ((.cse61 (select .cse65 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse59 (select .cse55 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse62 (select .cse60 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse57 (select .cse60 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse58 (select .cse55 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse53 (select .cse65 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse64 (select .cse55 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (.cse63 (select .cse65 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (and (= .cse19 .cse53) (= .cse54 .cse18) (= .cse54 (select .cse55 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= v_prenex_632 .cse56) (= .cse17 .cse56) (= .cse19 .cse57) (= v_prenex_642 .cse58) (= v_prenex_643 .cse59) (= .cse54 (select .cse60 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse61 v_prenex_614) (= .cse61 .cse58) (= (store .cse58 0 .cse52) v_prenex_610) (= .cse19 .cse59) (= .cse58 .cse62) (= v_prenex_612 .cse63) (= v_prenex_658 .cse62) (= v_prenex_633 .cse57) (= .cse58 .cse0) (= .cse64 v_prenex_644) (= v_prenex_611 .cse53) (= .cse64 .cse56) (= .cse63 .cse56)))))))))))))) (and .cse7 (or (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse74 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (exists ((v_prenex_651 (Array Int Int)) (v_prenex_640 (Array Int Int)) (v_prenex_652 (Array Int Int)) (v_prenex_641 (Array Int Int)) (v_prenex_620 (Array Int Int)) (v_prenex_653 (Array Int Int)) (v_prenex_621 (Array Int Int)) (v_prenex_654 (Array Int Int)) (v_prenex_622 (Array Int Int)) (v_prenex_655 (Array Int Int)) (v_prenex_623 (Array Int Int)) (v_prenex_656 (Array Int Int)) (v_prenex_624 (Array Int Int))) (let ((.cse71 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_624) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_621) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_622) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_623) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_620))) (let ((.cse70 (select .cse71 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse69 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_652) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_654) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_656) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_641) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse70 0 .cse74)))) (let ((.cse66 (select .cse69 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse67 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_651) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_653) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_655) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_640) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse66 0 .cse74)))) (let ((.cse73 (select .cse71 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse72 (select .cse67 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse68 (select .cse67 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= .cse17 .cse66) (= .cse66 (select .cse67 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse68 (select .cse69 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (select .cse69 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_654) (= .cse68 .cse0) (= .cse70 (select .cse69 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse71 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse68) (= .cse72 v_prenex_653) (= v_prenex_621 .cse73) (= .cse72 .cse73) (= .cse66 (select .cse71 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (<= 0 (+ 2147483648 (select .cse72 0))) (= .cse18 .cse70) (= (store .cse68 0 .cse74) v_prenex_620))))))))) (<= 0 .cse74)))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse75 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (<= 0 .cse75) (exists ((v_prenex_634 (Array Int Int)) (v_prenex_635 (Array Int Int)) (v_prenex_647 (Array Int Int)) (v_prenex_625 (Array Int Int)) (v_prenex_615 (Array Int Int)) (v_prenex_626 (Array Int Int)) (v_prenex_616 (Array Int Int)) (v_prenex_627 (Array Int Int)) (v_prenex_617 (Array Int Int)) (v_prenex_628 (Array Int Int)) (v_prenex_618 (Array Int Int)) (v_prenex_629 (Array Int Int)) (v_prenex_619 (Array Int Int))) (let ((.cse80 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_619) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_616) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_617) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_618) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_615))) (let ((.cse82 (select .cse80 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse78 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_647) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_629) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_628) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_627) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse82 0 .cse75)))) (let ((.cse76 (select .cse78 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse79 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_634) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_635) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_625) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_626) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse76 0 .cse75)))) (let ((.cse77 (select .cse79 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse81 (select .cse80 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse83 (select .cse78 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (and (= .cse17 .cse76) (= .cse77 (select .cse78 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (store .cse77 0 .cse75) v_prenex_615) (= .cse76 (select .cse79 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse77 (select .cse80 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse76 (select .cse80 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse77 .cse0) (= v_prenex_635 (select .cse79 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= v_prenex_616 .cse81) (= .cse18 .cse82) (<= 0 (+ 2147483648 (select .cse83 0))) (= (select .cse79 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse82) (= .cse83 .cse81) (= .cse83 v_prenex_629)))))))))))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse91 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (exists ((v_prenex_631 (Array Int Int)) (v_prenex_642 (Array Int Int)) (v_prenex_610 (Array Int Int)) (v_prenex_632 (Array Int Int)) (v_prenex_643 (Array Int Int)) (v_prenex_611 (Array Int Int)) (v_prenex_633 (Array Int Int)) (v_prenex_644 (Array Int Int)) (v_prenex_612 (Array Int Int)) (v_prenex_645 (Array Int Int)) (v_prenex_613 (Array Int Int)) (v_prenex_614 (Array Int Int)) (v_prenex_658 (Array Int Int))) (let ((.cse89 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_614) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_611) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_612) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_613) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_610))) (let ((.cse86 (select .cse89 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse92 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_658) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_633) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_632) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_631) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse86 0 .cse91)))) (let ((.cse88 (select .cse92 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse87 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_642) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_643) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_644) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_645) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse88 0 .cse91)))) (let ((.cse85 (select .cse87 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse84 (select .cse92 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse90 (select .cse87 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= .cse84 .cse85) (<= 0 (+ (select .cse84 0) 2147483648)) (= .cse86 .cse18) (= .cse86 (select .cse87 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse17 .cse88) (= v_prenex_643 .cse85) (= (select .cse89 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse90) (= (store .cse90 0 .cse91) v_prenex_610) (= .cse90 (select .cse92 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= v_prenex_633 .cse84) (= .cse90 .cse0) (= v_prenex_611 (select .cse89 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse87 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse88) (= (select .cse89 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse88))))))))) (<= 0 .cse91)))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse93 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (<= 0 .cse93) (exists ((v_prenex_650 (Array Int Int)) (v_prenex_630 (Array Int Int)) (v_prenex_601 (Array Int Int)) (v_prenex_602 (Array Int Int)) (v_prenex_603 (Array Int Int)) (v_prenex_636 (Array Int Int)) (v_prenex_604 (Array Int Int)) (v_prenex_637 (Array Int Int)) (v_prenex_648 (Array Int Int)) (v_prenex_605 (Array Int Int)) (v_prenex_638 (Array Int Int)) (v_prenex_649 (Array Int Int)) (v_prenex_639 (Array Int Int))) (let ((.cse95 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_605) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_602) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_603) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_604) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_601))) (let ((.cse97 (select .cse95 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse98 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_636) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_637) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_638) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_639) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse97 0 .cse93)))) (let ((.cse100 (select .cse98 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse99 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_630) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_648) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_649) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_650) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse100 0 .cse93)))) (let ((.cse96 (select .cse99 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse94 (select .cse95 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (and (<= 0 (+ (select .cse94 0) 2147483648)) (= (select .cse95 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse96) (= .cse97 (select .cse98 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse96 (select .cse98 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= v_prenex_648 (select .cse99 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse100 (select .cse99 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (store .cse96 0 .cse93) v_prenex_601) (= .cse96 .cse0) (= .cse100 (select .cse95 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse100 .cse17) (= .cse97 (select .cse99 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse18 .cse97) (= (select .cse98 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_637) (= v_prenex_602 .cse94)))))))))))))) (and (<= 0 .cse3) (or (and (exists ((v_prenex_390 (Array Int Int)) (v_prenex_391 (Array Int Int)) (v_prenex_392 (Array Int Int)) (v_prenex_393 (Array Int Int)) (v_prenex_700 (Array Int Int)) (v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_prenex_702 (Array Int Int)) (v_prenex_703 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse102 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_390) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_392) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_393) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_391))) (let ((.cse105 (select .cse102 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (let ((.cse104 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_700) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_702) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_703) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store .cse105 0 .cse3)))) (let ((.cse101 (select .cse104 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse106 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store .cse101 0 .cse3))) (.cse103 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse19))) (and (= .cse18 .cse101) (= (select .cse102 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse101) (= v_prenex_392 (select .cse102 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse103 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse101) (= (select .cse104 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse105) (= (select .cse104 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) v_prenex_702) (= (select .cse103 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse105) (= .cse101 (select .cse106 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse106 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) v_DerPreprocessor_3) (= (select .cse106 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse105) (= (select .cse103 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) v_DerPreprocessor_53) (= .cse3 (select v_prenex_391 0)) (= .cse105 .cse0)))))))) .cse35) (and (exists ((v_prenex_691 (Array Int Int)) (v_prenex_394 (Array Int Int)) (v_prenex_692 (Array Int Int)) (v_prenex_693 (Array Int Int)) (v_prenex_396 (Array Int Int)) (v_prenex_694 (Array Int Int)) (v_prenex_397 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_prenex_54 (Array Int Int)) (v_prenex_53 (Array Int Int)) (v_prenex_56 (Array Int Int))) (let ((.cse112 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_691) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_693) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_694) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_692))) (let ((.cse109 (select .cse112 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse110 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_53) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_54) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_56) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store .cse109 0 .cse3)))) (let ((.cse108 (select .cse110 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse107 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_394) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_396) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_397) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store .cse108 0 .cse3))) (.cse111 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse19))) (and (= v_prenex_394 (select .cse107 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (select .cse107 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse108) (= .cse109 (select .cse110 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse111 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse108) (= .cse3 (select v_prenex_692 0)) (= (select .cse110 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_prenex_53) (= .cse109 .cse18) (= (select .cse112 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse108) (= (select .cse107 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse109) (= v_prenex_691 (select .cse112 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse17 .cse108) (= (select .cse111 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_51) (= .cse109 (select .cse111 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))))))))) .cse42) (exists ((v_prenex_695 (Array Int Int)) (v_prenex_696 (Array Int Int)) (v_prenex_697 (Array Int Int)) (v_prenex_698 (Array Int Int)) (v_prenex_50 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_prenex_704 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_prenex_706 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_707 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse125 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_695) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_697) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_698) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_696))) (let ((.cse117 (select .cse125 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse118 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_49) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_50) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_52) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store .cse117 0 .cse3)))) (let ((.cse116 (select .cse118 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse123 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse19)) (.cse124 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_704) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_706) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_707) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store .cse116 0 .cse3)))) (let ((.cse113 (select .cse118 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse120 (select .cse125 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse121 (select .cse124 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (.cse119 (select .cse125 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (.cse114 (select .cse124 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse115 (select .cse123 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse122 (select .cse123 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (and (= .cse113 v_prenex_49) (= .cse114 .cse113) (= .cse115 .cse114) (= .cse116 v_prenex_50) (= .cse117 (select .cse118 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse119 v_prenex_697) (= .cse120 v_prenex_695) (= .cse17 .cse116) (= .cse18 .cse117) (= .cse120 .cse114) (= v_prenex_706 .cse121) (= .cse116 .cse121) (= .cse122 v_DerPreprocessor_53) (= .cse119 .cse116) (= .cse114 .cse0) (= .cse114 v_prenex_704) (= v_prenex_696 (store .cse114 0 .cse3)) (= .cse115 v_DerPreprocessor_51) (= (select .cse123 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse117) (= .cse122 .cse116) (= (select .cse124 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse117))))))))))) (and .cse7 (or (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse126 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (<= 0 .cse126) (exists ((v_prenex_590 (Array Int Int)) (v_prenex_386 (Array Int Int)) (v_prenex_387 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_prenex_388 (Array Int Int)) (v_prenex_587 (Array Int Int)) (v_prenex_389 (Array Int Int)) (v_prenex_588 (Array Int Int)) (v_prenex_589 (Array Int Int)) (v_prenex_72 (Array Int Int)) (v_prenex_71 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_prenex_69 (Array Int Int))) (let ((.cse132 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_590) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_587) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_588) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_589) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_586))) (let ((.cse129 (select .cse132 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse134 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_69) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_70) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_71) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_72) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse129 0 .cse126)))) (let ((.cse127 (select .cse134 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse130 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_386) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_387) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_388) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_389) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse127 0 .cse126)))) (let ((.cse128 (select .cse130 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse133 (select .cse134 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse131 (select .cse130 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= .cse17 .cse127) (<= 0 (+ (select .cse128 0) 2147483648)) (= v_prenex_387 .cse128) (= .cse129 (select .cse130 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= v_prenex_586 (store .cse131 0 .cse126)) (= (select .cse130 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse127) (= (select .cse132 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse127) (= (select .cse132 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse131) (= (select .cse132 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_587) (= .cse131 .cse0) (= .cse133 .cse128) (= .cse18 .cse129) (= .cse133 v_prenex_70) (= .cse131 (select .cse134 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))))))))))))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse141 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (exists ((v_prenex_380 (Array Int Int)) (v_prenex_381 (Array Int Int)) (v_prenex_374 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_596 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_prenex_597 (Array Int Int)) (v_prenex_377 (Array Int Int)) (v_prenex_598 (Array Int Int)) (v_prenex_378 (Array Int Int)) (v_prenex_599 (Array Int Int)) (v_prenex_379 (Array Int Int)) (v_prenex_600 (Array Int Int))) (let ((.cse135 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_600) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_597) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_598) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_599) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_596))) (let ((.cse137 (select .cse135 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse140 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_381) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse137 0 .cse141)))) (let ((.cse139 (select .cse140 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse142 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_374) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_380) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse139 0 .cse141)))) (let ((.cse136 (select .cse142 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse138 (select .cse142 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (and (= v_prenex_597 (select .cse135 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse136 .cse0) (= .cse18 .cse137) (= .cse138 v_prenex_376) (= .cse17 .cse139) (= .cse136 (select .cse140 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse139 (select .cse135 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse140 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_377) (= (store .cse136 0 .cse141) v_prenex_596) (= (select .cse140 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse137) (= (select .cse142 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse137) (= (select .cse135 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse136) (= (select .cse142 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse139) (<= 0 (+ (select .cse138 0) 2147483648)))))))))) (<= 0 .cse141)))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse148 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (exists ((v_prenex_591 (Array Int Int)) (v_prenex_371 (Array Int Int)) (v_prenex_592 (Array Int Int)) (v_prenex_372 (Array Int Int)) (v_prenex_593 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_prenex_594 (Array Int Int)) (v_prenex_595 (Array Int Int)) (v_prenex_369 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse143 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_595) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_592) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_593) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_594) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_591))) (let ((.cse145 (select .cse143 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse147 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_14) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse145 0 .cse148)))) (let ((.cse146 (select .cse147 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse149 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_369) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_371) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_372) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_373) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse146 0 .cse148)))) (let ((.cse144 (select .cse149 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= (select .cse143 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_592) (= .cse144 .cse0) (= .cse18 .cse145) (= .cse17 .cse146) (= .cse146 (select .cse143 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse147 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse144) (= (select .cse147 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse145) (= v_DerPreprocessor_12 (select .cse147 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse144 (select .cse143 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= v_prenex_591 (store .cse144 0 .cse148)) (= .cse145 (select .cse149 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse146 (select .cse149 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse149 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_371))))))))) (<= 0 .cse148)))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse150 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (and (<= 0 .cse150) (exists ((v_prenex_370 (Array Int Int)) (v_prenex_360 (Array Int Int)) (v_prenex_361 (Array Int Int)) (v_prenex_366 (Array Int Int)) (v_prenex_367 (Array Int Int)) (v_prenex_368 (Array Int Int)) (v_prenex_358 (Array Int Int)) (v_prenex_359 (Array Int Int)) (v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse151 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_39) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_40))) (let ((.cse154 (select .cse151 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse155 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_370) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_368) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_367) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_366) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse154 0 .cse150)))) (let ((.cse152 (select .cse155 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse157 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_358) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_359) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_360) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_361) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse152 0 .cse150)))) (let ((.cse156 (select .cse157 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse153 (select .cse155 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (and (= (select .cse151 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse152) (= v_prenex_368 .cse153) (= .cse18 .cse154) (= (select .cse155 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse156) (= v_DerPreprocessor_40 (store .cse156 0 .cse150)) (= .cse17 .cse152) (= .cse156 (select .cse151 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse154 (select .cse157 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse156 .cse0) (= (select .cse155 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse154) (= (select .cse157 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) v_prenex_359) (<= 0 (+ (select .cse153 0) 2147483648)) (= v_DerPreprocessor_37 (select .cse151 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse157 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse152)))))))))))))) (and (<= 0 .cse8) .cse158) (and (<= 0 (select .cse17 0)) .cse158))) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (<= 0 (+ (select .cse19 |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|) 2147483648)) .cse6)))) is different from true [2024-11-09 01:28:07,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:28:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:08,770 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-09 01:28:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:28:08,770 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-09 01:28:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:08,771 INFO L225 Difference]: With dead ends: 24 [2024-11-09 01:28:08,771 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 01:28:08,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 84.4s TimeCoverageRelationStatistics Valid=224, Invalid=754, Unknown=18, NotChecked=60, Total=1056 [2024-11-09 01:28:08,773 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:08,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 56 Invalid, 3 Unknown, 12 Unchecked, 2.8s Time] [2024-11-09 01:28:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 01:28:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 01:28:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-09 01:28:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-09 01:28:08,787 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2024-11-09 01:28:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-09 01:28:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-09 01:28:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-09 01:28:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:28:08,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:08,789 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1] [2024-11-09 01:28:08,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:08,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:08,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 01:28:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 584157547, now seen corresponding path program 2 times [2024-11-09 01:28:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:28:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040419598] [2024-11-09 01:28:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:08,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:28:11,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:28:11,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040419598] [2024-11-09 01:28:11,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040419598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:11,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385704956] [2024-11-09 01:28:11,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:28:11,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:28:11,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:11,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:28:11,462 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 01:28:11,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:28:11,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 01:28:11,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:11,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 42 treesize of output 38 [2024-11-09 01:28:11,917 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-09 01:28:12,074 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 18 treesize of output 13 [2024-11-09 01:28:12,311 INFO L349 Elim1Store]: treesize reduction 47, result has 42.0 percent of original size [2024-11-09 01:28:12,311 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 3 case distinctions, treesize of input 81 treesize of output 63 [2024-11-09 01:28:13,280 INFO L349 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2024-11-09 01:28:13,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 83 [2024-11-09 01:28:14,388 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-09 01:28:14,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 86 [2024-11-09 01:28:15,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:15,639 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 188 treesize of output 244 [2024-11-09 01:28:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 01:28:17,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:18,490 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_test_fun_#t~mem15#1| Int) (|ULTIMATE.start_test_fun_~i_ref~0#1.base| Int) (v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 Int) (|v_ULTIMATE.start_test_fun_#t~mem14#1_28| Int) (|ULTIMATE.start_test_fun_~tmp_ref~0#1.base| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_281))) (let ((.cse7 (store (select .cse9 |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| (select (select .cse9 |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|)))) (let ((.cse0 (store .cse9 |ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse7))) (let ((.cse5 (store (select .cse0 |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| v_ArrVal_282))) (let ((.cse8 (store .cse0 |ULTIMATE.start_test_fun_~i_ref~0#1.base| .cse5))) (or (< (+ 2147483649 |v_ULTIMATE.start_test_fun_#t~mem14#1_28|) 0) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem15#1|) 0) (< v_ArrVal_282 (select (select .cse0 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store (select .cse8 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem14#1_28| 1)))) (let ((.cse2 (store (select (store .cse8 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~k_ref~0#1.offset| (+ (- 1) |ULTIMATE.start_test_fun_#t~mem15#1|)))) (let ((.cse3 (let ((.cse6 (store (store (store (store |c_#memory_int| |ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse7) |ULTIMATE.start_test_fun_~i_ref~0#1.base| .cse5) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| .cse2))) (store (select .cse6 |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| (select (select .cse6 |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|))))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| .cse2) |ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse3) |ULTIMATE.start_test_fun_~i_ref~0#1.base| (let ((.cse4 (store (store (store (store |c_#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base| .cse5) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| .cse2) |ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse3))) (store (select .cse4 |ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|))))))) |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset|))) (< (select (select .cse8 |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem14#1_28|)))))))) is different from false [2024-11-09 01:28:20,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:20,043 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 381284167 treesize of output 210669887 [2024-11-09 01:28:23,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:23,279 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 1191631 treesize of output 1124217 [2024-11-09 01:28:24,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:24,178 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 6054 treesize of output 5960 [2024-11-09 01:28:24,609 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 126 treesize of output 116 [2024-11-09 01:28:34,837 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 01:28:34,838 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 91 treesize of output 86 [2024-11-09 01:28:35,068 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 115 treesize of output 109 [2024-11-09 01:28:36,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 01:28:36,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:28:36,672 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 78 treesize of output 72 [2024-11-09 01:28:36,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:28:36,820 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 78 treesize of output 72 [2024-11-09 01:28:37,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 01:28:37,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:37,427 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 862 treesize of output 824 [2024-11-09 01:28:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2024-11-09 01:28:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385704956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1666041254] [2024-11-09 01:28:40,238 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2024-11-09 01:28:40,239 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:28:40,239 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:28:40,239 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:28:40,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:28:41,420 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:28:47,825 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '481#(and (= |ULTIMATE.start_test_fun_~k_ref~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (<= 2 |ULTIMATE.start_test_fun_~k_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 2 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc6#1.base|) (<= 2 |ULTIMATE.start_test_fun_~i_ref~0#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~k#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~k#1| 2147483647) (<= 2 |ULTIMATE.start_test_fun_~j_ref~0#1.base|))' at error location [2024-11-09 01:28:47,826 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:28:47,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 26 [2024-11-09 01:28:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515654839] [2024-11-09 01:28:47,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 01:28:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 01:28:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=4, NotChecked=60, Total=1056 [2024-11-09 01:28:47,830 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 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-09 01:28:50,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:28:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:51,214 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-09 01:28:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:28:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 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-09 01:28:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:51,215 INFO L225 Difference]: With dead ends: 23 [2024-11-09 01:28:51,215 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 01:28:51,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=4, NotChecked=70, Total=1406 [2024-11-09 01:28:51,217 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:51,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 1 Unknown, 7 Unchecked, 2.2s Time] [2024-11-09 01:28:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 01:28:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 01:28:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-09 01:28:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 01:28:51,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2024-11-09 01:28:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:51,226 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 01:28:51,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 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-09 01:28:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 01:28:51,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 01:28:51,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 01:28:51,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 01:28:51,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 01:28:51,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 01:28:51,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:28:51,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:28:51,447 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-09 01:28:51,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 01:28:52,038 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:28:52,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:28:52 BoogieIcfgContainer [2024-11-09 01:28:52,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:28:52,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:28:52,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:28:52,055 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:28:52,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:21:37" (3/4) ... [2024-11-09 01:28:52,058 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 01:28:52,069 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 01:28:52,070 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 01:28:52,070 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 01:28:52,070 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 01:28:52,176 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 01:28:52,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/witness.yml [2024-11-09 01:28:52,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:28:52,178 INFO L158 Benchmark]: Toolchain (without parser) took 436229.17ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 140.7MB in the beginning and 688.3MB in the end (delta: -547.6MB). Peak memory consumption was 661.4MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,178 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 125.8MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:28:52,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.29ms. Allocated memory is still 178.3MB. Free memory was 140.2MB in the beginning and 121.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.00ms. Allocated memory is still 178.3MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,181 INFO L158 Benchmark]: Boogie Preprocessor took 35.16ms. Allocated memory is still 178.3MB. Free memory was 119.7MB in the beginning and 118.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,181 INFO L158 Benchmark]: RCFGBuilder took 586.38ms. Allocated memory is still 178.3MB. Free memory was 118.6MB in the beginning and 99.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,181 INFO L158 Benchmark]: TraceAbstraction took 434751.73ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 98.2MB in the beginning and 693.6MB in the end (delta: -595.3MB). Peak memory consumption was 611.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,182 INFO L158 Benchmark]: Witness Printer took 123.06ms. Allocated memory is still 1.4GB. Free memory was 693.6MB in the beginning and 688.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:28:52,184 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 125.8MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.29ms. Allocated memory is still 178.3MB. Free memory was 140.2MB in the beginning and 121.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.00ms. Allocated memory is still 178.3MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.16ms. Allocated memory is still 178.3MB. Free memory was 119.7MB in the beginning and 118.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 586.38ms. Allocated memory is still 178.3MB. Free memory was 118.6MB in the beginning and 99.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 434751.73ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 98.2MB in the beginning and 693.6MB in the end (delta: -595.3MB). Peak memory consumption was 611.1MB. Max. memory is 16.1GB. * Witness Printer took 123.06ms. Allocated memory is still 1.4GB. Free memory was 693.6MB in the beginning and 688.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 434.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 16 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 94.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 392.0s InterpolantComputationTime, 86 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 21 QuantifiedInterpolants, 45042 SizeOfPredicates, 32 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 27/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 01:28:52,405 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 01:28:52,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96fa8cbe-a24f-4f5d-a74e-db5147ffdf53/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE