./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --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 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:09:16,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:09:16,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:09:17,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:09:17,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:09:17,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:09:17,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:09:17,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:09:17,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:09:17,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:09:17,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:09:17,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:09:17,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:09:17,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:09:17,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:09:17,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:09:17,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:09:17,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:09:17,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:09:17,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:09:17,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:09:17,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:09:17,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:09:17,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:09:17,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:09:17,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:09:17,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:09:17,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:09:17,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:09:17,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:09:17,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:09:17,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:09:17,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:09:17,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:09:17,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:09:17,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:09:17,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:09:17,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:09:17,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:09:17,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:09:17,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:09:17,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 01:09:17,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:09:17,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:09:17,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:09:17,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:09:17,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:09:17,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:09:17,106 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:09:17,106 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:09:17,106 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:09:17,106 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:09:17,106 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:09:17,107 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:09:17,107 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:09:17,107 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:09:17,107 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:09:17,107 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:09:17,108 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:09:17,108 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:09:17,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:09:17,109 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:09:17,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:09:17,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:09:17,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:09:17,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:09:17,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:09:17,110 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:09:17,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:09:17,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:09:17,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:09:17,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:09:17,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:09:17,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:17,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:09:17,112 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:09:17,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:09:17,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:09:17,112 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:09:17,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:09:17,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:09:17,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:09:17,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/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_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a [2022-11-22 01:09:17,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:09:17,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:09:17,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:09:17,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:09:17,360 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:09:17,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2022-11-22 01:09:20,343 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:09:20,645 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:09:20,646 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2022-11-22 01:09:20,657 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/data/6e09c2a0e/d38c3598fe7043babb31382dc504afd2/FLAGf11e9140b [2022-11-22 01:09:20,678 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/data/6e09c2a0e/d38c3598fe7043babb31382dc504afd2 [2022-11-22 01:09:20,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:09:20,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:09:20,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:20,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:09:20,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:09:20,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:20" (1/1) ... [2022-11-22 01:09:20,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cde9d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:20, skipping insertion in model container [2022-11-22 01:09:20,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:20" (1/1) ... [2022-11-22 01:09:20,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:09:20,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:09:21,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:21,139 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:09:21,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:21,227 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:09:21,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21 WrapperNode [2022-11-22 01:09:21,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:21,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:09:21,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:09:21,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:09:21,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,279 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-11-22 01:09:21,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:09:21,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:09:21,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:09:21,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:09:21,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,305 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:09:21,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:09:21,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:09:21,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:09:21,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (1/1) ... [2022-11-22 01:09:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:21,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:09:21,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:09:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:09:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:09:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:09:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:09:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:09:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:09:21,494 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:09:21,496 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:09:21,651 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:09:21,703 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:09:21,704 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 01:09:21,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:21 BoogieIcfgContainer [2022-11-22 01:09:21,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:09:21,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:09:21,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:09:21,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:09:21,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:09:20" (1/3) ... [2022-11-22 01:09:21,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d3dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:21, skipping insertion in model container [2022-11-22 01:09:21,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:21" (2/3) ... [2022-11-22 01:09:21,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d3dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:21, skipping insertion in model container [2022-11-22 01:09:21,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:21" (3/3) ... [2022-11-22 01:09:21,729 INFO L112 eAbstractionObserver]: Analyzing ICFG b.14-alloca.i [2022-11-22 01:09:21,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:09:21,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-22 01:09:21,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:09:21,857 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2cba8c72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:09:21,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-22 01:09:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 18 states have internal predecessors, (22), 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) [2022-11-22 01:09:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:09:21,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:21,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:09:21,870 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1778736854, now seen corresponding path program 1 times [2022-11-22 01:09:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:21,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13142268] [2022-11-22 01:09:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:22,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13142268] [2022-11-22 01:09:22,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13142268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:09:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748168265] [2022-11-22 01:09:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:22,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:09:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:09:22,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:09:22,811 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 18 states have internal predecessors, (22), 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 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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) [2022-11-22 01:09:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:22,960 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-11-22 01:09:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:09:22,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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 [2022-11-22 01:09:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:22,970 INFO L225 Difference]: With dead ends: 54 [2022-11-22 01:09:22,970 INFO L226 Difference]: Without dead ends: 30 [2022-11-22 01:09:22,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:09:22,977 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:22,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 50 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-22 01:09:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-11-22 01:09:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 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) [2022-11-22 01:09:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-11-22 01:09:23,012 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2022-11-22 01:09:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:23,012 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-11-22 01:09:23,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 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) [2022-11-22 01:09:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-11-22 01:09:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:09:23,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:23,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:23,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:09:23,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 693732436, now seen corresponding path program 1 times [2022-11-22 01:09:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:23,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220214065] [2022-11-22 01:09:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:23,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:23,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220214065] [2022-11-22 01:09:23,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220214065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:23,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:23,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:09:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112282956] [2022-11-22 01:09:23,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:23,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:09:23,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:23,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:09:23,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:09:23,156 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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) [2022-11-22 01:09:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:23,257 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-11-22 01:09:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:09:23,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 [2022-11-22 01:09:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:23,258 INFO L225 Difference]: With dead ends: 32 [2022-11-22 01:09:23,258 INFO L226 Difference]: Without dead ends: 31 [2022-11-22 01:09:23,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:09:23,260 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:23,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-22 01:09:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-11-22 01:09:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-22 01:09:23,265 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2022-11-22 01:09:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:23,266 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-22 01:09:23,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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) [2022-11-22 01:09:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-22 01:09:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:09:23,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:23,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:09:23,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 30869100, now seen corresponding path program 1 times [2022-11-22 01:09:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:23,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709671580] [2022-11-22 01:09:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:23,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:23,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709671580] [2022-11-22 01:09:23,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709671580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:23,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:23,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 01:09:23,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024140064] [2022-11-22 01:09:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:23,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:09:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:23,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:09:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:09:23,635 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:23,873 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-11-22 01:09:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:09:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 01:09:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:23,875 INFO L225 Difference]: With dead ends: 39 [2022-11-22 01:09:23,876 INFO L226 Difference]: Without dead ends: 38 [2022-11-22 01:09:23,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:09:23,888 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:23,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 47 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-22 01:09:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2022-11-22 01:09:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-22 01:09:23,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2022-11-22 01:09:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:23,905 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-22 01:09:23,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-22 01:09:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:09:23,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:23,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:23,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:09:23,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash 956942166, now seen corresponding path program 1 times [2022-11-22 01:09:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:23,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370688933] [2022-11-22 01:09:23,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:24,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:24,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370688933] [2022-11-22 01:09:24,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370688933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:24,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:24,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:09:24,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146489237] [2022-11-22 01:09:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:24,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:09:24,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:09:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:09:24,424 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-11-22 01:09:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:24,587 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-22 01:09:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:09:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-11-22 01:09:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:24,588 INFO L225 Difference]: With dead ends: 33 [2022-11-22 01:09:24,588 INFO L226 Difference]: Without dead ends: 32 [2022-11-22 01:09:24,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:09:24,590 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:24,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-22 01:09:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-11-22 01:09:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-22 01:09:24,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2022-11-22 01:09:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:24,595 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-22 01:09:24,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-11-22 01:09:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-22 01:09:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:09:24,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:24,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:24,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:09:24,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -399563858, now seen corresponding path program 1 times [2022-11-22 01:09:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:24,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028177333] [2022-11-22 01:09:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:24,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:24,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028177333] [2022-11-22 01:09:24,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028177333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:24,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:24,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 01:09:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112222978] [2022-11-22 01:09:24,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:24,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:09:24,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:24,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:09:24,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:09:24,989 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:25,061 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-11-22 01:09:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:09:25,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:09:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:25,063 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:09:25,063 INFO L226 Difference]: Without dead ends: 32 [2022-11-22 01:09:25,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:09:25,064 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:25,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 60 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-22 01:09:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-22 01:09:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 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) [2022-11-22 01:09:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-22 01:09:25,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2022-11-22 01:09:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:25,071 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-22 01:09:25,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-22 01:09:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:09:25,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:25,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:25,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:09:25,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash 798637279, now seen corresponding path program 1 times [2022-11-22 01:09:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:25,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988277721] [2022-11-22 01:09:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:25,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:25,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988277721] [2022-11-22 01:09:25,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988277721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:25,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348099441] [2022-11-22 01:09:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:25,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:25,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:25,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:25,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:09:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:25,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-22 01:09:25,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:25,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-22 01:09:25,886 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-22 01:09:25,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 32 [2022-11-22 01:09:25,901 INFO L350 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 [2022-11-22 01:09:25,905 INFO L350 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 [2022-11-22 01:09:25,928 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:09:25,928 INFO L350 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 [2022-11-22 01:09:26,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:09:26,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:09:26,176 INFO L350 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 14 treesize of output 16 [2022-11-22 01:09:26,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 01:09:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:26,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:09:26,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483649)) is different from false [2022-11-22 01:09:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:30,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348099441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:09:30,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2048598042] [2022-11-22 01:09:30,784 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:09:30,784 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:09:30,788 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:09:30,793 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:09:30,794 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:09:30,895 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:09:30,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:09:30,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:09:30,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:30,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:30,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:30,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2022-11-22 01:09:31,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,216 INFO L350 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 71 treesize of output 45 [2022-11-22 01:09:31,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,320 INFO L350 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 84 treesize of output 54 [2022-11-22 01:09:31,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:31,424 INFO L350 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 43 treesize of output 37 [2022-11-22 01:09:31,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:31,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:31,841 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:09:31,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 350 treesize of output 308 [2022-11-22 01:09:32,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:32,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:32,177 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:09:32,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 366 treesize of output 320 [2022-11-22 01:09:32,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:32,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:32,525 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:09:32,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 336 [2022-11-22 01:09:32,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:09:32,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:32,986 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:09:32,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:09:33,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:33,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:33,144 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:09:33,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:09:33,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:09:33,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:33,455 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:09:33,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:09:33,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:33,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:33,612 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:09:33,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:09:33,942 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:09:36,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '580#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.offset|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (not (<= |ULTIMATE.start_test_fun_#t~mem10#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:09:36,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:09:36,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:09:36,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:09:36,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740130309] [2022-11-22 01:09:36,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:09:36,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:09:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:36,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:09:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=673, Unknown=15, NotChecked=54, Total=870 [2022-11-22 01:09:36,557 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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) [2022-11-22 01:09:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:36,809 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-22 01:09:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:09:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 01:09:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:36,809 INFO L225 Difference]: With dead ends: 32 [2022-11-22 01:09:36,810 INFO L226 Difference]: Without dead ends: 31 [2022-11-22 01:09:36,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=159, Invalid=760, Unknown=15, NotChecked=58, Total=992 [2022-11-22 01:09:36,811 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:36,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 63 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-11-22 01:09:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-22 01:09:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-22 01:09:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-22 01:09:36,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2022-11-22 01:09:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:36,816 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-22 01:09:36,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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) [2022-11-22 01:09:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-22 01:09:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:09:36,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:36,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:36,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:09:37,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:37,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:09:37,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1012048065, now seen corresponding path program 1 times [2022-11-22 01:09:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:37,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073213982] [2022-11-22 01:09:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:37,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:37,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073213982] [2022-11-22 01:09:37,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073213982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:37,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464316321] [2022-11-22 01:09:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:37,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:37,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:37,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:37,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:09:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:37,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 01:09:37,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:37,966 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-22 01:09:37,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-22 01:09:37,982 INFO L350 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 8 treesize of output 7 [2022-11-22 01:09:38,000 INFO L350 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 [2022-11-22 01:09:38,016 INFO L350 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 [2022-11-22 01:09:38,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:38,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:38,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:38,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:38,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 78 treesize of output 73 [2022-11-22 01:09:38,123 INFO L350 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 [2022-11-22 01:09:38,236 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-11-22 01:09:38,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 106 [2022-11-22 01:09:38,268 INFO L350 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 [2022-11-22 01:09:38,276 INFO L350 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 [2022-11-22 01:09:38,532 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-22 01:09:38,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 25 [2022-11-22 01:09:38,539 INFO L350 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 15 treesize of output 11 [2022-11-22 01:09:39,450 INFO L321 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2022-11-22 01:09:39,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 44 [2022-11-22 01:09:39,631 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-22 01:09:39,631 INFO L350 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 4 case distinctions, treesize of input 52 treesize of output 58 [2022-11-22 01:09:39,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:09:39,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:09:39,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-11-22 01:09:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:39,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:09:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:40,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464316321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:09:40,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833373179] [2022-11-22 01:09:40,943 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:09:40,943 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:09:40,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:09:40,944 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:09:40,944 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:09:40,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:40,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:41,011 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-22 01:09:41,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2022-11-22 01:09:41,068 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-22 01:09:41,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:09:41,124 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:09:41,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:09:41,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,328 INFO L350 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 82 treesize of output 56 [2022-11-22 01:09:41,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,403 INFO L350 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 99 treesize of output 69 [2022-11-22 01:09:41,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:41,470 INFO L350 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 81 treesize of output 59 [2022-11-22 01:09:41,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:09:41,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:41,622 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:09:41,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:09:41,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:41,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:41,737 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:09:41,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:09:41,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:09:42,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:42,052 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:09:42,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:09:42,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:42,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:09:42,187 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:09:42,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:09:42,400 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:09:45,239 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '785#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem10#1|) 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:09:45,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:09:45,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:09:45,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:09:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675193653] [2022-11-22 01:09:45,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:09:45,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:09:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:45,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:09:45,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1482, Unknown=32, NotChecked=0, Total=1722 [2022-11-22 01:09:45,243 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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) [2022-11-22 01:09:56,495 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 83 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:09:57,772 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse6 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (< 0 (+ .cse6 2147483648))) (.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse3 (forall ((v_ArrVal_258 Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (let ((.cse7 (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_258)))) (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_261))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_262))) (or (< (+ v_ArrVal_258 1) .cse6) (< (select (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ (select (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) (.cse1 (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|)))) (and (or .cse0 .cse1) (or .cse0 (< .cse2 1)) (or .cse3 (not (< 0 .cse2)) (not |c_ULTIMATE.start_test_fun_#t~short8#1|)) (or .cse3 .cse1) (forall ((v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_262))) (or (< (select (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ (select (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))) is different from false [2022-11-22 01:10:04,925 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 71 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:10:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:08,247 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2022-11-22 01:10:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-22 01:10:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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 15 [2022-11-22 01:10:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:08,248 INFO L225 Difference]: With dead ends: 125 [2022-11-22 01:10:08,248 INFO L226 Difference]: Without dead ends: 95 [2022-11-22 01:10:08,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=786, Invalid=4091, Unknown=97, NotChecked=138, Total=5112 [2022-11-22 01:10:08,251 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 238 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 71 mSolverCounterUnsat, 70 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 70 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:08,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 191 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 353 Invalid, 70 Unknown, 2 Unchecked, 1.0s Time] [2022-11-22 01:10:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-22 01:10:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2022-11-22 01:10:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 69 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:10:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-11-22 01:10:08,261 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 15 [2022-11-22 01:10:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:08,261 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-11-22 01:10:08,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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) [2022-11-22 01:10:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-11-22 01:10:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:10:08,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:08,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:08,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:10:08,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:08,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:10:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1308718879, now seen corresponding path program 1 times [2022-11-22 01:10:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:08,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709778024] [2022-11-22 01:10:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:10:09,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:09,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709778024] [2022-11-22 01:10:09,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709778024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:10:09,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544384325] [2022-11-22 01:10:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:09,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:09,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:10:09,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:10:09,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:10:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:09,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-22 01:10:09,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:10:09,532 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-22 01:10:09,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-22 01:10:09,561 INFO L350 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 8 treesize of output 7 [2022-11-22 01:10:09,580 INFO L350 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 [2022-11-22 01:10:09,598 INFO L350 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 [2022-11-22 01:10:09,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:09,860 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-22 01:10:09,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 88 [2022-11-22 01:10:09,877 INFO L350 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 [2022-11-22 01:10:09,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:09,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:09,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:09,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:09,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 48 [2022-11-22 01:10:09,986 INFO L350 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 [2022-11-22 01:10:09,992 INFO L350 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 [2022-11-22 01:10:11,783 INFO L321 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-11-22 01:10:11,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 257 treesize of output 264 [2022-11-22 01:10:11,867 INFO L350 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 13 treesize of output 9 [2022-11-22 01:10:11,885 INFO L350 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 [2022-11-22 01:10:12,123 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-22 01:10:12,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2022-11-22 01:10:12,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 01:10:12,249 INFO L350 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 [2022-11-22 01:10:12,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-22 01:10:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:10:12,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:10:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:10:19,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544384325] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:10:19,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384167067] [2022-11-22 01:10:19,368 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:10:19,369 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:10:19,369 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:10:19,369 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:10:19,369 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:10:19,444 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:10:19,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:10:19,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:10:19,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2022-11-22 01:10:19,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,614 INFO L350 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 71 treesize of output 45 [2022-11-22 01:10:19,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,662 INFO L350 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 57 treesize of output 43 [2022-11-22 01:10:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:19,707 INFO L350 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 43 treesize of output 37 [2022-11-22 01:10:19,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:19,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:19,864 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:19,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 347 treesize of output 305 [2022-11-22 01:10:20,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,039 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:20,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 363 treesize of output 317 [2022-11-22 01:10:20,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,239 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:20,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 333 [2022-11-22 01:10:20,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:20,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,534 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:20,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:20,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,649 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:20,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:20,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:20,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,863 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:20,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:20,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:20,973 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:20,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:21,150 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:10:23,918 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1204#(and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem11#1|) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0) (not (<= |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648)))' at error location [2022-11-22 01:10:23,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:10:23,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:10:23,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-22 01:10:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285831157] [2022-11-22 01:10:23,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:10:23,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 01:10:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 01:10:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1267, Unknown=28, NotChecked=0, Total=1482 [2022-11-22 01:10:23,921 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 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) [2022-11-22 01:10:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:26,295 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2022-11-22 01:10:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 01:10:26,295 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:10:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:26,297 INFO L225 Difference]: With dead ends: 118 [2022-11-22 01:10:26,297 INFO L226 Difference]: Without dead ends: 69 [2022-11-22 01:10:26,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=434, Invalid=2375, Unknown=53, NotChecked=0, Total=2862 [2022-11-22 01:10:26,300 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 118 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 49 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:26,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 33 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 241 Invalid, 21 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:10:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-22 01:10:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-11-22 01:10:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.305084745762712) internal successors, (77), 62 states have internal predecessors, (77), 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) [2022-11-22 01:10:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-11-22 01:10:26,311 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 16 [2022-11-22 01:10:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:26,311 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-11-22 01:10:26,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 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) [2022-11-22 01:10:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-11-22 01:10:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:10:26,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:26,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:26,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:10:26,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:26,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:10:26,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1915579519, now seen corresponding path program 1 times [2022-11-22 01:10:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:26,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329467633] [2022-11-22 01:10:26,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:10:26,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:26,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329467633] [2022-11-22 01:10:26,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329467633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:10:26,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693289417] [2022-11-22 01:10:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:26,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:26,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:10:26,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:10:26,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:10:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:10:26,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:10:26,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:10:26,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2022-11-22 01:10:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:10:26,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:10:27,065 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-22 01:10:27,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-11-22 01:10:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:10:27,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693289417] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:10:27,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:10:27,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2022-11-22 01:10:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223831752] [2022-11-22 01:10:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:10:27,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:10:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:27,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:10:27,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:10:27,071 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-11-22 01:10:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:27,175 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-11-22 01:10:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:10:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-11-22 01:10:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:27,176 INFO L225 Difference]: With dead ends: 63 [2022-11-22 01:10:27,176 INFO L226 Difference]: Without dead ends: 62 [2022-11-22 01:10:27,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:10:27,177 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:27,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:10:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-22 01:10:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-22 01:10:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 61 states have internal predecessors, (73), 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) [2022-11-22 01:10:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-11-22 01:10:27,187 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 17 [2022-11-22 01:10:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:27,188 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-11-22 01:10:27,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-11-22 01:10:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-11-22 01:10:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:10:27,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:27,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:10:27,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-22 01:10:27,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 01:10:27,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:10:27,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash 746577123, now seen corresponding path program 1 times [2022-11-22 01:10:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:27,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603433891] [2022-11-22 01:10:27,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:10:27,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603433891] [2022-11-22 01:10:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603433891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:10:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317866002] [2022-11-22 01:10:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:27,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:10:27,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:10:27,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:10:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:28,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-22 01:10:28,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:10:28,182 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-22 01:10:28,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-22 01:10:28,198 INFO L350 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 8 treesize of output 7 [2022-11-22 01:10:28,214 INFO L350 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 [2022-11-22 01:10:28,228 INFO L350 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 [2022-11-22 01:10:28,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:28,338 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-11-22 01:10:28,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 117 [2022-11-22 01:10:28,375 INFO L350 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 24 treesize of output 18 [2022-11-22 01:10:28,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:28,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:28,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:28,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:28,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 96 treesize of output 87 [2022-11-22 01:10:28,445 INFO L350 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 24 treesize of output 18 [2022-11-22 01:10:28,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-11-22 01:10:28,533 INFO L350 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 15 treesize of output 11 [2022-11-22 01:10:28,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:28,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 20 [2022-11-22 01:10:28,601 INFO L350 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 15 treesize of output 11 [2022-11-22 01:10:28,645 INFO L350 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 14 treesize of output 12 [2022-11-22 01:10:29,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:29,063 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 01:10:29,063 INFO L350 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 3 case distinctions, treesize of input 82 treesize of output 81 [2022-11-22 01:10:29,106 INFO L350 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 [2022-11-22 01:10:29,184 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:10:29,184 INFO L350 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-22 01:10:29,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:10:29,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:10:29,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:29,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 01:10:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:10:29,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:10:29,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (or (not (<= v_ArrVal_477 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_477)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-22 01:10:29,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_476))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_477)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_477))))) is different from false [2022-11-22 01:10:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-22 01:10:31,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317866002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:10:31,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076386232] [2022-11-22 01:10:31,876 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:10:31,876 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:10:31,876 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:10:31,877 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:10:31,877 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:10:31,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:31,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:31,948 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-22 01:10:31,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2022-11-22 01:10:32,007 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:10:32,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:10:32,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:10:32,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,164 INFO L350 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 82 treesize of output 56 [2022-11-22 01:10:32,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,216 INFO L350 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 99 treesize of output 69 [2022-11-22 01:10:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:32,273 INFO L350 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 81 treesize of output 59 [2022-11-22 01:10:32,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:32,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:32,421 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:32,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:32,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:32,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:32,552 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:32,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:32,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:32,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:32,766 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:32,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:32,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:32,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:32,869 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:32,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:33,042 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:10:35,558 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1851#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem12#1|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483648)) (not (<= |ULTIMATE.start_test_fun_#t~mem12#1| 2147483646)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483646) (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647))) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:10:35,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:10:35,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:10:35,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-11-22 01:10:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646953078] [2022-11-22 01:10:35,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:10:35,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 01:10:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 01:10:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=919, Unknown=25, NotChecked=130, Total=1260 [2022-11-22 01:10:35,561 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 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) [2022-11-22 01:10:35,680 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse2 (not .cse6)) (.cse3 (= .cse4 0))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (not |c_ULTIMATE.start_test_fun_#t~short8#1|) (and (<= 1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse1 .cse2 .cse3)) (<= .cse4 1) (let ((.cse5 (<= .cse4 0))) (or (and .cse5 .cse6) (and .cse5 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse7 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 .cse8) (= .cse4 (select v_DerPreprocessor_33 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (= v_DerPreprocessor_31 .cse8)))))))) .cse1 .cse2 .cse3))) is different from true [2022-11-22 01:10:40,480 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_477 Int) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_476))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_477)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_477))))) (forall ((v_ArrVal_480 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-22 01:10:40,537 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_477 Int) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_476))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_477)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_477))))) (forall ((v_ArrVal_480 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-22 01:10:40,666 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_477 Int) (v_ArrVal_479 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_477)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_477))))))) (and (or .cse0 (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) .cse0)) is different from false [2022-11-22 01:10:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:42,749 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2022-11-22 01:10:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-22 01:10:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:10:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:42,751 INFO L225 Difference]: With dead ends: 104 [2022-11-22 01:10:42,751 INFO L226 Difference]: Without dead ends: 103 [2022-11-22 01:10:42,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=360, Invalid=1485, Unknown=71, NotChecked=534, Total=2450 [2022-11-22 01:10:42,752 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 86 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 36 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:42,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 73 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 150 Invalid, 46 Unknown, 56 Unchecked, 0.5s Time] [2022-11-22 01:10:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-22 01:10:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-11-22 01:10:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.175257731958763) internal successors, (114), 99 states have internal predecessors, (114), 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) [2022-11-22 01:10:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-11-22 01:10:42,765 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 18 [2022-11-22 01:10:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:42,766 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-11-22 01:10:42,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 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) [2022-11-22 01:10:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-11-22 01:10:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:10:42,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:42,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-22 01:10:42,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:10:42,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 01:10:42,971 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:10:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1669054403, now seen corresponding path program 1 times [2022-11-22 01:10:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690589469] [2022-11-22 01:10:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:10:43,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690589469] [2022-11-22 01:10:43,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690589469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:10:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269590005] [2022-11-22 01:10:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:10:43,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:10:43,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:10:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:43,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 01:10:43,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:10:43,631 INFO L350 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 44 treesize of output 42 [2022-11-22 01:10:43,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:43,686 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-11-22 01:10:43,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-11-22 01:10:43,695 INFO L350 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 8 treesize of output 7 [2022-11-22 01:10:43,705 INFO L350 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 [2022-11-22 01:10:43,778 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-22 01:10:43,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 25 [2022-11-22 01:10:43,783 INFO L350 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 15 treesize of output 11 [2022-11-22 01:10:43,807 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse0 (<= 0 .cse2))) (or (and .cse0 (not (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and .cse0 (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_36))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_34) (= (select v_DerPreprocessor_36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) .cse2)))))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) is different from true [2022-11-22 01:10:44,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:44,161 INFO L321 Elim1Store]: treesize reduction 26, result has 57.4 percent of original size [2022-11-22 01:10:44,162 INFO L350 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 4 case distinctions, treesize of input 94 treesize of output 115 [2022-11-22 01:10:44,186 INFO L350 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 [2022-11-22 01:10:44,205 INFO L350 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 [2022-11-22 01:10:44,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 01:10:44,324 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 01:10:44,325 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 37 [2022-11-22 01:10:44,339 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 01:10:44,449 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:10:44,450 INFO L350 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 2 case distinctions, treesize of input 42 treesize of output 45 [2022-11-22 01:10:44,797 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:10:44,798 INFO L350 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 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-22 01:10:44,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:44,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-22 01:10:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 01:10:44,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:10:44,926 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))) is different from false [2022-11-22 01:10:51,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_556)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_557))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_558)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| (+ v_ArrVal_556 1))) (< (+ v_ArrVal_558 2147483648) 0) (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (< v_ArrVal_558 (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1)) (< (+ v_ArrVal_560 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-22 01:10:51,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_556)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_557))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_558)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_558 2147483648) 0) (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (< v_ArrVal_558 (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1)) (< (+ v_ArrVal_560 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_556 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))) is different from false [2022-11-22 01:10:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-22 01:10:51,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269590005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:10:51,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1187490501] [2022-11-22 01:10:51,571 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:10:51,571 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:10:51,571 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:10:51,571 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:10:51,571 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:10:51,623 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-22 01:10:51,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:10:51,676 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:10:51,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:10:51,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2022-11-22 01:10:51,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,833 INFO L350 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 71 treesize of output 45 [2022-11-22 01:10:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,885 INFO L350 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 62 treesize of output 44 [2022-11-22 01:10:51,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:51,928 INFO L350 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 43 treesize of output 37 [2022-11-22 01:10:52,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,091 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:52,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 350 treesize of output 308 [2022-11-22 01:10:52,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,311 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:52,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 378 treesize of output 324 [2022-11-22 01:10:52,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,464 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:52,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 398 treesize of output 336 [2022-11-22 01:10:52,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:52,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,687 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:52,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:52,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:52,817 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:52,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:52,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:53,003 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:53,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:53,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:53,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:53,112 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:53,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:53,282 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:10:55,991 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2272#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem12#1|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (< (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem12#1|) 0) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483648)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483646) (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647))) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:10:55,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:10:55,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:10:55,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-22 01:10:55,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469337782] [2022-11-22 01:10:55,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:10:55,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 01:10:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:10:55,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 01:10:55,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=876, Unknown=16, NotChecked=260, Total=1332 [2022-11-22 01:10:55,992 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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) [2022-11-22 01:10:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:10:56,550 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-11-22 01:10:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:10:56,550 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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 19 [2022-11-22 01:10:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:10:56,551 INFO L225 Difference]: With dead ends: 100 [2022-11-22 01:10:56,551 INFO L226 Difference]: Without dead ends: 99 [2022-11-22 01:10:56,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=16, NotChecked=308, Total=1806 [2022-11-22 01:10:56,552 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:10:56,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 32 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 109 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-11-22 01:10:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-22 01:10:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-22 01:10:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 98 states have internal predecessors, (108), 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) [2022-11-22 01:10:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-22 01:10:56,569 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 19 [2022-11-22 01:10:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:10:56,569 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-22 01:10:56,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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) [2022-11-22 01:10:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-22 01:10:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:10:56,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:10:56,571 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2022-11-22 01:10:56,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:10:56,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:56,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:10:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:10:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1483854467, now seen corresponding path program 1 times [2022-11-22 01:10:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:10:56,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98065868] [2022-11-22 01:10:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:10:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 01:10:56,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:10:56,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98065868] [2022-11-22 01:10:56,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98065868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:10:56,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47784890] [2022-11-22 01:10:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:10:56,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:10:56,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:10:56,848 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:10:56,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:10:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:10:56,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:10:56,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:10:56,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 01:10:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 01:10:56,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:10:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 01:10:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47784890] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:10:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160923320] [2022-11-22 01:10:57,040 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:10:57,040 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:10:57,041 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:10:57,041 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:10:57,041 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:10:57,136 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-22 01:10:57,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:10:57,184 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:10:57,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:10:57,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2022-11-22 01:10:57,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,397 INFO L350 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 71 treesize of output 45 [2022-11-22 01:10:57,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,444 INFO L350 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 57 treesize of output 43 [2022-11-22 01:10:57,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:10:57,494 INFO L350 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 59 treesize of output 45 [2022-11-22 01:10:57,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:57,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:57,748 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:57,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 354 treesize of output 308 [2022-11-22 01:10:57,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:57,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:57,914 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:57,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 370 treesize of output 320 [2022-11-22 01:10:58,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,127 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:10:58,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 394 treesize of output 336 [2022-11-22 01:10:58,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:58,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,545 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:58,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:58,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,651 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:58,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:58,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:10:58,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,932 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:10:58,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:10:58,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:58,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:10:59,042 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:10:59,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:10:59,528 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:11:01,422 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2718#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem12#1|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483648)) (not (<= |ULTIMATE.start_test_fun_#t~mem12#1| 2147483646)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483646) (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647))) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:11:01,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:11:01,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:11:01,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-22 01:11:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002972859] [2022-11-22 01:11:01,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:11:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:11:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:11:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:11:01,424 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-11-22 01:11:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:01,470 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-11-22 01:11:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:11:01,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 30 [2022-11-22 01:11:01,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:01,471 INFO L225 Difference]: With dead ends: 130 [2022-11-22 01:11:01,471 INFO L226 Difference]: Without dead ends: 44 [2022-11-22 01:11:01,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:11:01,472 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:01,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:11:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-22 01:11:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-22 01:11:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 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) [2022-11-22 01:11:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-11-22 01:11:01,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 30 [2022-11-22 01:11:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:01,478 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-11-22 01:11:01,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-11-22 01:11:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-11-22 01:11:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 01:11:01,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:01,479 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-11-22 01:11:01,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 01:11:01,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:01,685 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:11:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 249843200, now seen corresponding path program 2 times [2022-11-22 01:11:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560543791] [2022-11-22 01:11:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:02,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560543791] [2022-11-22 01:11:02,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560543791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:11:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847347821] [2022-11-22 01:11:02,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:11:02,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:11:02,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:11:02,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:11:02,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-22 01:11:02,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:11:02,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-22 01:11:02,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:11:03,010 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-22 01:11:03,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-22 01:11:03,026 INFO L350 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 8 treesize of output 7 [2022-11-22 01:11:03,043 INFO L350 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 [2022-11-22 01:11:03,058 INFO L350 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 [2022-11-22 01:11:03,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:03,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:03,141 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-22 01:11:03,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 96 [2022-11-22 01:11:03,168 INFO L350 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 [2022-11-22 01:11:03,177 INFO L350 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 [2022-11-22 01:11:03,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:03,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:03,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 92 treesize of output 83 [2022-11-22 01:11:03,248 INFO L350 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 [2022-11-22 01:11:03,407 INFO L321 Elim1Store]: treesize reduction 85, result has 8.6 percent of original size [2022-11-22 01:11:03,407 INFO L350 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 6 case distinctions, treesize of input 161 treesize of output 40 [2022-11-22 01:11:03,425 INFO L350 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 22 treesize of output 16 [2022-11-22 01:11:03,507 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-22 01:11:03,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 28 [2022-11-22 01:11:03,511 INFO L350 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 15 treesize of output 11 [2022-11-22 01:11:04,673 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-22 01:11:04,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 418 treesize of output 369 [2022-11-22 01:11:04,868 INFO L350 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 [2022-11-22 01:11:04,922 INFO L350 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 21 treesize of output 16 [2022-11-22 01:11:04,949 INFO L350 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 21 treesize of output 16 [2022-11-22 01:11:05,022 INFO L350 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 21 treesize of output 16 [2022-11-22 01:11:05,178 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-22 01:11:05,178 INFO L350 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 2 case distinctions, treesize of input 21 treesize of output 34 [2022-11-22 01:11:05,198 INFO L350 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 [2022-11-22 01:11:05,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-22 01:11:05,420 INFO L350 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 32 treesize of output 20 [2022-11-22 01:11:05,491 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:11:05,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-22 01:11:05,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 01:11:05,623 INFO L350 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 34 treesize of output 22 [2022-11-22 01:11:05,700 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:11:05,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-22 01:11:05,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 01:11:05,832 INFO L350 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 34 treesize of output 22 [2022-11-22 01:11:05,905 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:11:05,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-22 01:11:05,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 01:11:06,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:11:06,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2022-11-22 01:11:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:06,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:11:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 20 refuted. 44 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:09,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847347821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:11:09,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [594883045] [2022-11-22 01:11:09,516 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:11:09,516 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:11:09,517 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:11:09,517 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:11:09,517 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:11:09,568 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:11:09,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:11:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2022-11-22 01:11:09,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:11:09,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,714 INFO L350 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 71 treesize of output 45 [2022-11-22 01:11:09,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,746 INFO L350 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 57 treesize of output 43 [2022-11-22 01:11:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:09,786 INFO L350 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 43 treesize of output 37 [2022-11-22 01:11:09,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:09,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:09,905 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:11:09,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 347 treesize of output 305 [2022-11-22 01:11:10,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,051 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:11:10,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 364 treesize of output 314 [2022-11-22 01:11:10,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,207 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-22 01:11:10,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 328 [2022-11-22 01:11:10,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:11:10,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,410 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:11:10,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:11:10,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,506 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:11:10,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:11:10,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:11:10,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,670 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:11:10,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:11:10,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:11:10,766 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:11:10,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:11:10,896 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:11:13,804 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3216#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem10#1|) 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:11:13,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:11:13,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:11:13,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 21] total 51 [2022-11-22 01:11:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566657646] [2022-11-22 01:11:13,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:11:13,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-22 01:11:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-22 01:11:13,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=3054, Unknown=331, NotChecked=0, Total=3906 [2022-11-22 01:11:13,808 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 52 states have internal predecessors, (115), 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) [2022-11-22 01:11:14,212 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (not |c_ULTIMATE.start_test_fun_#t~short8#1|)) (.cse0 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (.cse2 (not .cse6)) (.cse5 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (or (< 0 .cse0) .cse1) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (and (or .cse2 (and .cse3 (= (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0))) (or (and (<= 1 .cse0) .cse5) .cse6)) .cse1) (or (and (= .cse0 0) .cse3) .cse2) (or .cse5 .cse6) (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (let ((.cse7 (<= .cse13 0))) (or (and .cse6 .cse7) (let ((.cse10 (select .cse4 0))) (and (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_39))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse8 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_38 .cse8) (= v_DerPreprocessor_37 .cse9) (= .cse10 (select v_DerPreprocessor_39 0)) (= .cse11 .cse9) (= .cse4 .cse8))))) (<= .cse10 0) (= .cse10 .cse13))) (and (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_39))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse14 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_38 .cse14) (= v_DerPreprocessor_37 .cse15) (= .cse11 .cse15) (= (select v_DerPreprocessor_39 0) .cse13) (= .cse4 .cse14))))) .cse7) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_42) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_42))) (and (= v_DerPreprocessor_41 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_DerPreprocessor_42 0) .cse13) (= .cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) .cse7)))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2022-11-22 01:12:25,889 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification that was a NOOP. DAG size: 317 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:12:26,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_750)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_752))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< (+ v_ArrVal_753 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_750 1) .cse2)))))) (or (< 0 (+ .cse2 2147483648)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) .cse2)))) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_745 Int) (v_ArrVal_752 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_745)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_748))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_750)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_752))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_750 1) (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_745 1) .cse2) (< (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-22 01:12:27,002 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_750)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_752))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< (+ v_ArrVal_753 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_750 1) .cse2)))))) (or (< 0 (+ .cse2 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) .cse2)))) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_745 Int) (v_ArrVal_752 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_745)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_748))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_750)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_752))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_750 1) (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_745 1) .cse2) (< (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-22 01:12:30,946 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_750)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_752))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< (+ v_ArrVal_753 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_750 1) .cse2)))))) (or (< 0 (+ .cse2 2147483648)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) .cse2))))))) is different from false [2022-11-22 01:12:30,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_750 Int) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_750)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_752))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< (+ v_ArrVal_753 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_750 1) .cse2)))))) (or (< 0 (+ .cse2 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) .cse2))))))) is different from false [2022-11-22 01:12:37,285 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (or (< 0 (+ .cse0 2147483648)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_753)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_756))) (or (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_753 1) .cse0))))))) is different from false [2022-11-22 01:12:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:38,934 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-11-22 01:12:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-22 01:12:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 52 states have internal predecessors, (115), 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 39 [2022-11-22 01:12:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:38,935 INFO L225 Difference]: With dead ends: 86 [2022-11-22 01:12:38,935 INFO L226 Difference]: Without dead ends: 85 [2022-11-22 01:12:38,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2656 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=1508, Invalid=6376, Unknown=696, NotChecked=1122, Total=9702 [2022-11-22 01:12:38,938 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 274 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 156 mSolverCounterUnsat, 353 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 353 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:38,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 148 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 351 Invalid, 353 Unknown, 6 Unchecked, 2.7s Time] [2022-11-22 01:12:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-22 01:12:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-11-22 01:12:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 80 states have internal predecessors, (85), 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) [2022-11-22 01:12:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-11-22 01:12:38,948 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 39 [2022-11-22 01:12:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:38,948 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-11-22 01:12:38,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 52 states have internal predecessors, (115), 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) [2022-11-22 01:12:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-11-22 01:12:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 01:12:38,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:38,949 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-11-22 01:12:38,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-22 01:12:39,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 01:12:39,156 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:12:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash -99489150, now seen corresponding path program 2 times [2022-11-22 01:12:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:39,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502087511] [2022-11-22 01:12:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:12:40,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502087511] [2022-11-22 01:12:40,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502087511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:12:40,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388121069] [2022-11-22 01:12:40,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:12:40,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:12:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:12:40,407 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:12:40,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:12:40,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-22 01:12:40,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:12:40,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-22 01:12:40,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:12:40,851 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-22 01:12:40,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-22 01:12:40,866 INFO L350 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 8 treesize of output 7 [2022-11-22 01:12:40,880 INFO L350 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 [2022-11-22 01:12:40,893 INFO L350 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 [2022-11-22 01:12:41,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:41,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:41,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 62 [2022-11-22 01:12:41,159 INFO L350 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 22 treesize of output 16 [2022-11-22 01:12:41,166 INFO L350 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 [2022-11-22 01:12:41,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:41,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:41,359 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-22 01:12:41,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 117 [2022-11-22 01:12:41,411 INFO L350 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 [2022-11-22 01:12:42,502 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-22 01:12:42,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 105 [2022-11-22 01:12:42,516 INFO L350 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 [2022-11-22 01:12:42,523 INFO L350 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 [2022-11-22 01:12:42,536 INFO L350 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 [2022-11-22 01:12:42,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-22 01:12:42,722 INFO L350 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 32 treesize of output 20 [2022-11-22 01:12:42,825 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:12:42,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-22 01:12:42,857 INFO L350 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 20 [2022-11-22 01:12:42,935 INFO L350 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 32 treesize of output 20 [2022-11-22 01:12:43,049 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:12:43,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-22 01:12:43,088 INFO L350 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 20 [2022-11-22 01:12:43,172 INFO L350 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 32 treesize of output 20 [2022-11-22 01:12:43,288 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:12:43,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-22 01:12:43,323 INFO L350 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 20 [2022-11-22 01:12:43,476 INFO L350 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 32 treesize of output 20 [2022-11-22 01:12:43,693 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:12:43,694 INFO L350 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 2 case distinctions, treesize of input 39 treesize of output 42 [2022-11-22 01:12:43,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:43,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 01:12:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 72 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:12:43,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:12:43,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-22 01:12:46,467 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-22 01:12:46,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (not (<= v_ArrVal_876 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))))))))) is different from false [2022-11-22 01:12:46,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_880) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)))))))))) is different from false [2022-11-22 01:12:46,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (+ 1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))) is different from false [2022-11-22 01:12:46,903 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (not (<= v_ArrVal_871 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))) is different from false [2022-11-22 01:12:46,983 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871))))))))))) is different from false [2022-11-22 01:12:47,064 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))) is different from false [2022-11-22 01:12:47,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_868)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< 2147483647 v_ArrVal_880) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_868 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871))))))))))) is different from false [2022-11-22 01:12:47,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_866))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_868)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_868) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871))))))))))))) is different from false [2022-11-22 01:12:47,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int)) (v_ArrVal_865 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_866))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_868)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< 2147483647 v_ArrVal_880) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_868))))))))))))) is different from false [2022-11-22 01:12:47,614 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_870 (Array Int Int)) (v_ArrVal_868 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int)) (v_ArrVal_865 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_866 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_866))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_868)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< 2147483647 v_ArrVal_880) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_868)))))))))))))) is different from false [2022-11-22 01:12:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 74 not checked. [2022-11-22 01:12:48,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388121069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:12:48,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1947575285] [2022-11-22 01:12:48,080 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:12:48,080 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:12:48,080 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:12:48,081 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:12:48,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:12:48,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,144 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-22 01:12:48,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2022-11-22 01:12:48,194 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:12:48,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:12:48,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:12:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,326 INFO L350 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 82 treesize of output 56 [2022-11-22 01:12:48,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,370 INFO L350 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 77 treesize of output 55 [2022-11-22 01:12:48,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:48,434 INFO L350 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 81 treesize of output 59 [2022-11-22 01:12:48,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:12:48,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,560 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:12:48,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:12:48,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,655 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:12:48,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:12:48,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:12:48,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,861 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:12:48,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:12:48,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:12:48,966 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:12:48,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:12:49,104 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:12:52,111 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3784#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem12#1|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483648)) (not (<= |ULTIMATE.start_test_fun_#t~mem12#1| 2147483646)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483646) (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647))) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:12:52,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:12:52,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:12:52,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 19] total 49 [2022-11-22 01:12:52,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122688959] [2022-11-22 01:12:52,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:12:52,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-22 01:12:52,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-22 01:12:52,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2030, Unknown=61, NotChecked=1260, Total=3660 [2022-11-22 01:12:52,114 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 51 states, 50 states have (on average 2.5) internal successors, (125), 50 states have internal predecessors, (125), 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) [2022-11-22 01:13:00,857 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))) (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (+ 1 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:13:00,872 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (or (not (<= (+ v_ArrVal_882 1) |c_ULTIMATE.start_test_fun_#t~mem10#1|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_880 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (+ 1 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:13:00,887 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880))))))) (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_870))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_871))))))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_880) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1))))))))))) is different from false [2022-11-22 01:13:00,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse12 (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| 2147483646))) (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (not (<= v_ArrVal_876 .cse3)))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (not (<= v_ArrVal_871 .cse3)) (< (select (select (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))) (or (not .cse12) (forall ((v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= v_ArrVal_880 .cse3)) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) .cse12)) is different from false [2022-11-22 01:13:00,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (not (<= v_ArrVal_876 .cse3)))))))) (forall ((v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= v_ArrVal_880 .cse3)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_871 Int) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_871)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (not (<= v_ArrVal_871 .cse3)) (< (select (select (store (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))) is different from false [2022-11-22 01:13:00,925 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (+ 1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:13:00,938 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (or (not (<= (+ v_ArrVal_882 1) |c_ULTIMATE.start_test_fun_#t~mem10#1|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int) (v_ArrVal_873 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< 2147483647 v_ArrVal_880) (< (+ 1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:13:00,949 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880))))))) (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_874))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_880) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1))))))))))) is different from false [2022-11-22 01:13:00,958 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse6 (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| 2147483646))) (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (not (<= v_ArrVal_876 .cse3)))))))) (or (not .cse6) (forall ((v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= v_ArrVal_880 .cse3)) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) .cse6)) is different from false [2022-11-22 01:13:00,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (not (<= v_ArrVal_876 .cse3)))))))) (forall ((v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= v_ArrVal_880 .cse3)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-22 01:13:00,975 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1))))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:13:00,985 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 Int) (v_ArrVal_883 (Array Int Int))) (or (not (<= (+ v_ArrVal_882 1) |c_ULTIMATE.start_test_fun_#t~mem10#1|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:13:00,991 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_882 Int) (v_ArrVal_880 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_878))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_880)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_880) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_882)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_882 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_880))))))) (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-22 01:13:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:03,633 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-11-22 01:13:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-22 01:13:03,634 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.5) internal successors, (125), 50 states have internal predecessors, (125), 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 42 [2022-11-22 01:13:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:03,635 INFO L225 Difference]: With dead ends: 94 [2022-11-22 01:13:03,635 INFO L226 Difference]: Without dead ends: 93 [2022-11-22 01:13:03,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 96 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=890, Invalid=4332, Unknown=134, NotChecked=4150, Total=9506 [2022-11-22 01:13:03,638 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 170 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 89 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:03,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 74 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 235 Invalid, 25 Unknown, 304 Unchecked, 0.7s Time] [2022-11-22 01:13:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-22 01:13:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-11-22 01:13:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 91 states have internal predecessors, (93), 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) [2022-11-22 01:13:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-11-22 01:13:03,650 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 42 [2022-11-22 01:13:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:03,651 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-11-22 01:13:03,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.5) internal successors, (125), 50 states have internal predecessors, (125), 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) [2022-11-22 01:13:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-11-22 01:13:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-22 01:13:03,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:03,653 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2022-11-22 01:13:03,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:13:03,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 01:13:03,860 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:13:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 692349591, now seen corresponding path program 3 times [2022-11-22 01:13:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:03,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995590338] [2022-11-22 01:13:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-11-22 01:13:07,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995590338] [2022-11-22 01:13:07,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995590338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:13:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489457155] [2022-11-22 01:13:07,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:13:07,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:13:07,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:13:07,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:13:07,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:13:07,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:13:07,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-22 01:13:07,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:13:08,205 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-22 01:13:08,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-22 01:13:08,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-22 01:13:08,302 INFO L350 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 17 treesize of output 15 [2022-11-22 01:13:08,354 INFO L350 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 25 treesize of output 19 [2022-11-22 01:13:08,564 INFO L350 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 25 treesize of output 19 [2022-11-22 01:13:10,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,280 INFO L321 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2022-11-22 01:13:10,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 248 [2022-11-22 01:13:10,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 1229 treesize of output 1309 [2022-11-22 01:13:10,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:10,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 1234 treesize of output 1312 [2022-11-22 01:13:14,281 INFO L350 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 5566 treesize of output 4825 [2022-11-22 01:13:16,095 INFO L350 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 [2022-11-22 01:13:16,173 INFO L350 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 [2022-11-22 01:13:16,237 INFO L350 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 [2022-11-22 01:13:17,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:17,531 INFO L350 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 23 treesize of output 7 [2022-11-22 01:13:17,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:17,593 INFO L350 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 23 treesize of output 7 [2022-11-22 01:13:19,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:19,307 INFO L321 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-11-22 01:13:19,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 512 treesize of output 439 [2022-11-22 01:13:19,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:19,356 INFO L350 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 13 treesize of output 11 [2022-11-22 01:13:19,372 INFO L350 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 [2022-11-22 01:13:19,408 INFO L350 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 [2022-11-22 01:13:19,419 INFO L350 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 [2022-11-22 01:13:19,504 INFO L350 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 15 treesize of output 11 [2022-11-22 01:13:19,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:19,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:19,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:19,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:19,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 64 [2022-11-22 01:13:19,828 INFO L350 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 [2022-11-22 01:13:19,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:19,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:19,973 INFO L321 Elim1Store]: treesize reduction 43, result has 38.6 percent of original size [2022-11-22 01:13:19,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 633 treesize of output 752 [2022-11-22 01:13:20,003 INFO L350 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 527 treesize of output 515 [2022-11-22 01:13:20,038 INFO L350 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 511 treesize of output 509 [2022-11-22 01:13:20,109 INFO L350 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 [2022-11-22 01:13:20,586 INFO L350 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 [2022-11-22 01:13:20,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:20,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:20,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:20,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 83 [2022-11-22 01:13:20,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:20,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:20,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:13:20,865 INFO L350 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 74 treesize of output 40 [2022-11-22 01:13:21,179 INFO L350 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 44 treesize of output 42 [2022-11-22 01:13:21,808 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-22 01:13:21,808 INFO L350 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 4 case distinctions, treesize of input 46 treesize of output 52 [2022-11-22 01:13:22,024 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:22,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2022-11-22 01:13:22,168 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:22,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-22 01:13:22,419 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:22,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 43 [2022-11-22 01:13:22,590 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:22,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:22,723 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:22,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:22,896 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:22,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:23,047 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:23,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:23,171 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:23,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:23,353 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:23,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:23,509 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:23,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:23,644 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:23,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:23,834 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:23,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:23,985 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:23,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:24,123 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:24,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:24,322 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:24,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:24,484 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:24,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:24,612 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:24,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:24,838 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:24,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:25,012 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:25,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:25,160 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:25,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:25,355 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:25,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:25,517 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:25,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:25,640 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:25,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:25,849 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:25,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-22 01:13:26,132 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 01:13:26,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-11-22 01:13:26,277 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:13:26,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-11-22 01:13:26,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 01:13:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:13:26,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:18:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 84 refuted. 240 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:18:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489457155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:18:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [30236135] [2022-11-22 01:18:48,631 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-22 01:18:48,631 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:18:48,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:18:48,632 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:18:48,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:18:48,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:48,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:48,716 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-22 01:18:48,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 33 [2022-11-22 01:18:48,778 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 01:18:48,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 45 [2022-11-22 01:18:48,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-22 01:18:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:48,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:48,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:48,908 INFO L350 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 82 treesize of output 56 [2022-11-22 01:18:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:48,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:48,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:48,957 INFO L350 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 99 treesize of output 69 [2022-11-22 01:18:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:49,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:49,006 INFO L350 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 97 treesize of output 67 [2022-11-22 01:18:49,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:18:49,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:49,140 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:18:49,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:18:49,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:49,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:49,274 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:18:49,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:18:49,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:18:49,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:49,479 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 01:18:49,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 01:18:49,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:49,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:18:49,626 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-22 01:18:49,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 91 [2022-11-22 01:18:49,816 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:19:03,397 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4642#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem10#1|) 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-22 01:19:03,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:19:03,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:19:03,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 34, 41] total 85 [2022-11-22 01:19:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933448782] [2022-11-22 01:19:03,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:19:03,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-22 01:19:03,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:19:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-22 01:19:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1498, Invalid=7137, Unknown=677, NotChecked=0, Total=9312 [2022-11-22 01:19:03,403 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 87 states, 86 states have (on average 2.046511627906977) internal successors, (176), 86 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:19:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:19:11,847 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-11-22 01:19:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:19:11,848 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 2.046511627906977) internal successors, (176), 86 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-11-22 01:19:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:19:11,849 INFO L225 Difference]: With dead ends: 92 [2022-11-22 01:19:11,849 INFO L226 Difference]: Without dead ends: 91 [2022-11-22 01:19:11,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 232.1s TimeCoverageRelationStatistics Valid=2118, Invalid=9195, Unknown=677, NotChecked=0, Total=11990 [2022-11-22 01:19:11,853 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 151 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:19:11,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 46 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-22 01:19:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-22 01:19:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-22 01:19:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 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) [2022-11-22 01:19:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-11-22 01:19:11,868 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 79 [2022-11-22 01:19:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:19:11,868 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-11-22 01:19:11,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 2.046511627906977) internal successors, (176), 86 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:19:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-11-22 01:19:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-22 01:19:11,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:19:11,870 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2022-11-22 01:19:11,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:19:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:19:12,077 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:19:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:19:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1805156672, now seen corresponding path program 3 times [2022-11-22 01:19:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:19:12,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405527817] [2022-11-22 01:19:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:19:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:15,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:19:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405527817] [2022-11-22 01:19:15,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405527817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:19:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294613545] [2022-11-22 01:19:15,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:19:15,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:19:15,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:19:15,730 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:19:15,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea087c81-e49b-4017-a5c9-7ab616aac593/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:19:15,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:19:15,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:19:15,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-22 01:19:15,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:19:16,137 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-22 01:19:16,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-22 01:19:16,153 INFO L350 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 8 treesize of output 7 [2022-11-22 01:19:16,171 INFO L350 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 [2022-11-22 01:19:16,186 INFO L350 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 [2022-11-22 01:19:16,530 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-22 01:19:16,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 184 [2022-11-22 01:19:16,562 INFO L350 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 [2022-11-22 01:19:16,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:19:16,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-11-22 01:19:16,625 INFO L350 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 [2022-11-22 01:19:16,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 20 [2022-11-22 01:19:16,708 INFO L350 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 15 treesize of output 11 [2022-11-22 01:19:16,973 INFO L350 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 10 treesize of output 8 [2022-11-22 01:19:19,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:19:19,460 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-22 01:19:19,461 INFO L350 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 3 case distinctions, treesize of input 81 treesize of output 72 [2022-11-22 01:19:19,496 INFO L350 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 [2022-11-22 01:19:19,501 INFO L350 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 [2022-11-22 01:19:19,656 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-22 01:19:19,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 30 [2022-11-22 01:19:19,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:19,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:20,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:20,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:20,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:20,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:20,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:20,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:20,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:20,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:21,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:21,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:21,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:21,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:21,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:21,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:22,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:22,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:22,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:22,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:22,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:22,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:22,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:23,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:23,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:23,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 01:19:23,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-22 01:19:23,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-22 01:19:24,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 01:19:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:19:24,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-22 01:19:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:24,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:19:24,446 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-22 01:19:25,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-22 01:19:25,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1318 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1318 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1))))))))) is different from false [2022-11-22 01:19:25,627 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (not (<= (+ v_ArrVal_1316 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318)))))))))) is different from false [2022-11-22 01:19:25,779 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))))))))))) is different from false [2022-11-22 01:19:26,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (not (<= v_ArrVal_1313 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))))))) is different from false [2022-11-22 01:19:26,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (not (<= (+ v_ArrVal_1312 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318)))))))))))))) is different from false [2022-11-22 01:19:26,687 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1))))))))))))))))) is different from false [2022-11-22 01:19:27,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse4 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (not (<= v_ArrVal_1308 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))))))))))) is different from false [2022-11-22 01:19:28,061 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse4 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (not (<= (+ v_ArrVal_1306 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1))))))))))))))))))) is different from false [2022-11-22 01:19:28,690 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse4 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse2 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse8 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse0 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313)))))))))))))))))))) is different from false [2022-11-22 01:19:30,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse2 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse5 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse8 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (not (<= v_ArrVal_1304 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))))))))))))))) is different from false [2022-11-22 01:19:31,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse6 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse9 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (not (<= (+ v_ArrVal_1302 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1))))))))))))))))))))))) is different from false [2022-11-22 01:19:32,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse3 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse7 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse4 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse6 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse5 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse0 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse9 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ 1 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1318) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323)))))))))))))))))))))))) is different from false [2022-11-22 01:19:35,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse2 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse8 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse7 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse10 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse1 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse0 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (not (<= v_ArrVal_1298 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1))))))))))))))))))))))))) is different from false [2022-11-22 01:19:37,821 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1297 Int) (v_ArrVal_1321 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse5 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse1 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse6 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse2 (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse0 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse10 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse4 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ 1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1313) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (not (<= (+ v_ArrVal_1297 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select (select (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))))))))))))))))))))) is different from false [2022-11-22 01:19:40,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1297 Int) (v_ArrVal_1321 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse8 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse1 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse4 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse3 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse12 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse9 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse6 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse7 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse2 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1))))))))))))))))))))))))))))) is different from false [2022-11-22 01:19:48,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1321 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse12 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse2 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse8 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse9 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse0 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse11 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse5 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse6 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse1 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (not (<= v_ArrVal_1294 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1))))))))))))))))))))))))))))) is different from false [2022-11-22 01:19:52,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1321 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse0 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse2 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse13 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (store (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse5 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse12 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse4 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse9 (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse1 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse10 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse6 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse8 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (not (<= (+ v_ArrVal_1292 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298)))))))))))))))))))))))))))))) is different from false [2022-11-22 01:19:58,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1321 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1323 Int) (v_ArrVal_1302 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1304 Int) (v_ArrVal_1318 Int) (v_ArrVal_1306 Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse2 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse1 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse11 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse9 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse6 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse14 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse7 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse13 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse5 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse10 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse4 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse3 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304)))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:20:11,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse13 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse5 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse10 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse11 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse4 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse12 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse14 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse6 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse7 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse1 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse2 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse8 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse9 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (not (<= v_ArrVal_1289 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (+ 1 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1298) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:20:21,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse9 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse8 (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse0 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse1 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse2 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse6 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse7 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (store (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse4 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse5 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse15 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse10 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse12 (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse11 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (not (<= (+ v_ArrVal_1287 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:20:33,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse15 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse2 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse4 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse8 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse14 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse12 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse3 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse11 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse13 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse5 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse10 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse9 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse6 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse1 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323)))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:20:58,493 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse3 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse14 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse1 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse10 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse0 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse7 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse8 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse13 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse5 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse11 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse6 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse4 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse12 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse2 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (not (<= v_ArrVal_1284 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select (select (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323)))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:21:13,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1281)))) (let ((.cse16 (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse33 (store (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse0 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse13 (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse31 (store (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse11 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse2 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse12 (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse6 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse14 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse8 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse5 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse15 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (store (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse3 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse10 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse7 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse1 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse9 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (not (<= (+ v_ArrVal_1281 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1284) (< (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1))))))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:21:29,697 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1280))) (let ((.cse3 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1281)))) (let ((.cse14 (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse7 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse12 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse1 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse2 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse10 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse17 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse4 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse9 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse15 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse13 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse16 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse6 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse11 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse0 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse8 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1281 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select (select (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ 1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1313) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1284) (< (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318)))))))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:22:08,800 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1298 Int) (v_ArrVal_1279 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1279)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1280))) (let ((.cse14 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1281)))) (let ((.cse1 (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse17 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse7 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse4 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse0 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse5 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse18 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse8 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse10 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse11 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse13 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse15 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse9 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse3 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse12 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse6 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1284) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1279 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1281 1)) (< (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298)))))))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:22:33,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1277 Int) (v_ArrVal_1298 Int) (v_ArrVal_1279 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1277)))) (let ((.cse14 (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse37 (store (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1279)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1280))) (let ((.cse13 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1281)))) (let ((.cse6 (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse35 (store (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse7 (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse19 (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse33 (store (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse9 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse0 (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse31 (store (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse11 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse17 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse16 (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse3 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse5 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse18 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse1 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse2 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (store (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse4 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse8 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse10 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse12 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (not (<= (+ v_ArrVal_1277 1) |c_ULTIMATE.start_test_fun_#t~mem11#1|)) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1284) (< (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)) (< (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1281 1)) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1279) (< (select (select (store (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (select (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289)))))))))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:23:01,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1277 Int) (v_ArrVal_1298 Int) (v_ArrVal_1279 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1275))) (let ((.cse14 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1277)))) (let ((.cse15 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse38 (store (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1279)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1280))) (let ((.cse12 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1281)))) (let ((.cse1 (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse36 (store (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse17 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse10 (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse5 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse9 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse18 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse0 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse8 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse19 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse4 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse16 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse3 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse7 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse6 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse11 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse2 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1284) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1281 1)) (< (select (select (store (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1277 1)) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1279) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1))))))))))))))))))))))))))))))))))))))))))))) is different from false [2022-11-22 01:23:31,132 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_1315 (Array Int Int)) (v_ArrVal_1310 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1281 Int) (v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1284 Int) (v_ArrVal_1321 Int) (v_ArrVal_1287 Int) (v_ArrVal_1323 Int) (v_ArrVal_1289 Int) (v_ArrVal_1302 Int) (v_ArrVal_1304 Int) (v_ArrVal_1306 Int) (v_ArrVal_1308 Int) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1292 Int) (v_ArrVal_1294 Int) (v_ArrVal_1297 Int) (v_ArrVal_1277 Int) (v_ArrVal_1298 Int) (v_ArrVal_1279 Int) (v_ArrVal_1312 Int) (v_ArrVal_1313 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1275))) (let ((.cse14 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1277)))) (let ((.cse15 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse38 (store (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1279)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1280))) (let ((.cse12 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1281)))) (let ((.cse1 (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse36 (store (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1284)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1285))) (let ((.cse17 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1287)))) (let ((.cse10 (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1289)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1290))) (let ((.cse5 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1292)))) (let ((.cse9 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1294)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1295))) (let ((.cse18 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1297)))) (let ((.cse0 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1300))) (let ((.cse8 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1302)))) (let ((.cse19 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1304)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1305))) (let ((.cse4 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1306)))) (let ((.cse16 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1308)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1310))) (let ((.cse3 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1312)))) (let ((.cse7 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1313)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1315))) (let ((.cse6 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1316)))) (let ((.cse11 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1318)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1320))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1321)))) (let ((.cse2 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1323)))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1298) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1284) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1323) (< (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1312 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1306 1)) (< (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1292 1)) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1316 1)) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1313) (< (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1302 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1294) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1289) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1318) (< (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1281 1)) (< (select (select (store (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1325) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1277 1)) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1279) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1308) (< (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1287 1)) (< (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1297 1)) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1304) (< (select (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_1321 1)))))))))))))))))))))))))))))))))))))))))))))) is different from false