./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 21a06ce5e98962e93aa29e180f0bc8e543a622b520b6d7eef2d0a57c9849b220 --- 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-8393723 [2022-11-18 20:20:25,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:20:25,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:20:25,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:20:25,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:20:25,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:20:25,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:20:25,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:20:25,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:20:25,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:20:25,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:20:25,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:20:25,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:20:25,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:20:25,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:20:25,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:20:25,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:20:25,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:20:25,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:20:25,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:20:25,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:20:25,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:20:25,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:20:25,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:20:25,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:20:25,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:20:25,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:20:25,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:20:25,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:20:25,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:20:25,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:20:25,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:20:25,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:20:25,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:20:25,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:20:25,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:20:25,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:20:25,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:20:25,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:20:25,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:20:25,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:20:25,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 20:20:25,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:20:25,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:20:25,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:20:25,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:20:25,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:20:25,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:20:25,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:20:25,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:20:25,603 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:20:25,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:20:25,604 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:20:25,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:20:25,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:20:25,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:20:25,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:20:25,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:20:25,606 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:20:25,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:20:25,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:20:25,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:20:25,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:20:25,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:20:25,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:20:25,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:20:25,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:20:25,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:20:25,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:20:25,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:20:25,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:20:25,611 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:20:25,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:20:25,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:20:25,612 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_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/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_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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 -> 21a06ce5e98962e93aa29e180f0bc8e543a622b520b6d7eef2d0a57c9849b220 [2022-11-18 20:20:25,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:20:25,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:20:25,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:20:25,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:20:25,912 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:20:25,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i [2022-11-18 20:20:25,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/data/5bc6e3b0b/4dff1ed7dd764aefb0bb85cabb55507a/FLAG16113ea6f [2022-11-18 20:20:26,553 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:20:26,554 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/sv-benchmarks/c/termination-memory-alloca/b.06-alloca.i [2022-11-18 20:20:26,566 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/data/5bc6e3b0b/4dff1ed7dd764aefb0bb85cabb55507a/FLAG16113ea6f [2022-11-18 20:20:26,877 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/data/5bc6e3b0b/4dff1ed7dd764aefb0bb85cabb55507a [2022-11-18 20:20:26,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:20:26,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:20:26,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:20:26,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:20:26,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:20:26,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:20:26" (1/1) ... [2022-11-18 20:20:26,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5415ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:26, skipping insertion in model container [2022-11-18 20:20:26,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:20:26" (1/1) ... [2022-11-18 20:20:26,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:20:26,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:20:27,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:20:27,243 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:20:27,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:20:27,332 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:20:27,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27 WrapperNode [2022-11-18 20:20:27,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:20:27,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:20:27,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:20:27,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:20:27,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,393 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-11-18 20:20:27,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:20:27,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:20:27,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:20:27,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:20:27,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,411 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:20:27,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:20:27,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:20:27,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:20:27,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (1/1) ... [2022-11-18 20:20:27,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:20:27,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:20:27,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:20:27,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:20:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:20:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:20:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:20:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:20:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:20:27,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:20:27,588 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:20:27,590 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:20:27,778 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:20:27,785 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:20:27,785 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:20:27,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:20:27 BoogieIcfgContainer [2022-11-18 20:20:27,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:20:27,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:20:27,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:20:27,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:20:27,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:20:26" (1/3) ... [2022-11-18 20:20:27,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb547ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:20:27, skipping insertion in model container [2022-11-18 20:20:27,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:27" (2/3) ... [2022-11-18 20:20:27,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb547ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:20:27, skipping insertion in model container [2022-11-18 20:20:27,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:20:27" (3/3) ... [2022-11-18 20:20:27,814 INFO L112 eAbstractionObserver]: Analyzing ICFG b.06-alloca.i [2022-11-18 20:20:27,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:20:27,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-18 20:20:27,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:20:27,925 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@873a58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:20:27,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:20:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6) 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-18 20:20:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:20:27,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:27,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:20:27,937 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-18 20:20:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash 889569447, now seen corresponding path program 1 times [2022-11-18 20:20:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:27,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716822088] [2022-11-18 20:20:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:28,997 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-18 20:20:29,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:29,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716822088] [2022-11-18 20:20:29,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716822088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:29,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:29,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:20:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831444238] [2022-11-18 20:20:29,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:29,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:20:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:20:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:20:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:20:29,047 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) 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) Second operand has 6 states, 5 states have (on average 1.2) 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-18 20:20:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:29,173 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-11-18 20:20:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:20:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) 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-18 20:20:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:29,185 INFO L225 Difference]: With dead ends: 43 [2022-11-18 20:20:29,186 INFO L226 Difference]: Without dead ends: 27 [2022-11-18 20:20:29,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:20:29,196 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:29,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:20:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-18 20:20:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-11-18 20:20:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:20:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-18 20:20:29,230 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-11-18 20:20:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:29,230 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-18 20:20:29,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) 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-18 20:20:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-18 20:20:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:20:29,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:29,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:29,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:20:29,232 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-18 20:20:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849133, now seen corresponding path program 1 times [2022-11-18 20:20:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:29,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926017863] [2022-11-18 20:20:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:29,346 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-18 20:20:29,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:29,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926017863] [2022-11-18 20:20:29,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926017863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:29,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:29,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:20:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489641922] [2022-11-18 20:20:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:29,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:20:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:20:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:20:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:20:29,359 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-18 20:20:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:29,417 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-11-18 20:20:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:20:29,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-18 20:20:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:29,419 INFO L225 Difference]: With dead ends: 22 [2022-11-18 20:20:29,419 INFO L226 Difference]: Without dead ends: 21 [2022-11-18 20:20:29,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:20:29,421 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:29,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:20:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-18 20:20:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-11-18 20:20:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 19 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-18 20:20:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-18 20:20:29,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2022-11-18 20:20:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:29,427 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-18 20:20:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-18 20:20:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-18 20:20:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:20:29,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:29,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:29,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:20:29,429 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-18 20:20:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash 177748329, now seen corresponding path program 1 times [2022-11-18 20:20:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:29,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551819361] [2022-11-18 20:20:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:29,607 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-18 20:20:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551819361] [2022-11-18 20:20:29,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551819361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:29,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:29,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:20:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879106470] [2022-11-18 20:20:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:29,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:20:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:20:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:20:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:20:29,611 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 20:20:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:29,655 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-18 20:20:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:20:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 20:20:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:29,656 INFO L225 Difference]: With dead ends: 31 [2022-11-18 20:20:29,657 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 20:20:29,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:20:29,658 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:29,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:20:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 20:20:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-11-18 20:20:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 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-18 20:20:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-18 20:20:29,664 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2022-11-18 20:20:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:29,665 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-18 20:20:29,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-18 20:20:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-18 20:20:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:20:29,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:29,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:29,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:20:29,666 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-18 20:20:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1215230959, now seen corresponding path program 1 times [2022-11-18 20:20:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:29,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747206979] [2022-11-18 20:20:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:29,828 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-18 20:20:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:29,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747206979] [2022-11-18 20:20:29,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747206979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:29,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:29,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:20:29,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740578424] [2022-11-18 20:20:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:29,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:20:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:20:29,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:20:29,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:20:29,832 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 5 states have (on average 1.8) 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-18 20:20:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:29,889 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-11-18 20:20:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:20:29,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) 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-18 20:20:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:29,891 INFO L225 Difference]: With dead ends: 24 [2022-11-18 20:20:29,891 INFO L226 Difference]: Without dead ends: 23 [2022-11-18 20:20:29,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:20:29,893 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:29,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:20:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-18 20:20:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-18 20:20:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 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-18 20:20:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-18 20:20:29,898 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2022-11-18 20:20:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:29,899 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-18 20:20:29,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) 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-18 20:20:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-18 20:20:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:20:29,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:29,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:29,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:20:29,901 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-18 20:20:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash -982545877, now seen corresponding path program 1 times [2022-11-18 20:20:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182910420] [2022-11-18 20:20:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:30,177 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-18 20:20:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:30,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182910420] [2022-11-18 20:20:30,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182910420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:30,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:30,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:20:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533545787] [2022-11-18 20:20:30,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:30,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:20:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:20:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:20:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:20:30,181 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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-18 20:20:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:30,237 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-18 20:20:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:20:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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-18 20:20:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:30,238 INFO L225 Difference]: With dead ends: 28 [2022-11-18 20:20:30,239 INFO L226 Difference]: Without dead ends: 26 [2022-11-18 20:20:30,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:20:30,240 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:30,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:20:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-18 20:20:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-18 20:20:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:20:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-18 20:20:30,246 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2022-11-18 20:20:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:30,246 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-18 20:20:30,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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-18 20:20:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-11-18 20:20:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:20:30,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:30,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:30,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:20:30,248 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-18 20:20:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 292948182, now seen corresponding path program 1 times [2022-11-18 20:20:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:30,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237851152] [2022-11-18 20:20:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:30,859 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-18 20:20:30,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:30,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237851152] [2022-11-18 20:20:30,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237851152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:30,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867742825] [2022-11-18 20:20:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:30,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:20:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:20:30,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:20:30,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:20:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:30,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:20:30,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:31,140 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-18 20:20:31,142 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 2 case distinctions, treesize of input 234 treesize of output 192 [2022-11-18 20:20:31,270 INFO L321 Elim1Store]: treesize reduction 141, result has 25.4 percent of original size [2022-11-18 20:20:31,271 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 184 treesize of output 248 [2022-11-18 20:20:31,296 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-18 20:20:31,318 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-18 20:20:31,392 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-18 20:20:31,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,423 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 58 treesize of output 53 [2022-11-18 20:20:31,433 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-18 20:20:31,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 65 treesize of output 58 [2022-11-18 20:20:31,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 9 treesize of output 7 [2022-11-18 20:20:31,527 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 45 treesize of output 62 [2022-11-18 20:20:31,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,642 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-18 20:20:31,675 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-18 20:20:31,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,694 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 128 treesize of output 94 [2022-11-18 20:20:31,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:31,703 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-18 20:20:31,732 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-18 20:20:31,737 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:20:38,226 INFO L321 Elim1Store]: treesize reduction 42, result has 39.1 percent of original size [2022-11-18 20:20:38,227 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 1894 treesize of output 1809 [2022-11-18 20:20:38,373 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-18 20:20:38,427 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:20:38,451 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:20:38,570 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-18 20:20:38,857 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 20:20:38,909 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 46 treesize of output 39 [2022-11-18 20:20:39,653 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-18 20:20:39,653 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 50 treesize of output 60 [2022-11-18 20:20:39,933 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 21 treesize of output 21 [2022-11-18 20:20:40,121 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-18 20:20:40,129 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-18 20:20:40,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:54,246 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-18 20:20:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867742825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:54,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:20:54,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 24 [2022-11-18 20:20:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277032589] [2022-11-18 20:20:54,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:54,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:20:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:20:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:20:54,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=467, Unknown=46, NotChecked=0, Total=600 [2022-11-18 20:20:54,250 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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-18 20:21:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:05,005 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-11-18 20:21:05,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:21:05,005 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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 15 [2022-11-18 20:21:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:05,006 INFO L225 Difference]: With dead ends: 52 [2022-11-18 20:21:05,006 INFO L226 Difference]: Without dead ends: 51 [2022-11-18 20:21:05,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=254, Invalid=1007, Unknown=71, NotChecked=0, Total=1332 [2022-11-18 20:21:05,008 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:05,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2022-11-18 20:21:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-18 20:21:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-11-18 20:21:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.263157894736842) internal successors, (48), 41 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-18 20:21:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-18 20:21:05,015 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 15 [2022-11-18 20:21:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:05,016 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-18 20:21:05,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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-18 20:21:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-18 20:21:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:21:05,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:05,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:05,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:05,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:21:05,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:21:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 551113620, now seen corresponding path program 1 times [2022-11-18 20:21:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:05,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151177111] [2022-11-18 20:21:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:21:05,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:05,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151177111] [2022-11-18 20:21:05,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151177111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:05,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:05,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:21:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695089334] [2022-11-18 20:21:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:05,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:21:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:05,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:21:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:05,275 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 20:21:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:05,303 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-18 20:21:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 20:21:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:05,304 INFO L225 Difference]: With dead ends: 55 [2022-11-18 20:21:05,305 INFO L226 Difference]: Without dead ends: 23 [2022-11-18 20:21:05,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:05,306 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:05,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:21:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-18 20:21:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-18 20:21:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-11-18 20:21:05,311 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 15 [2022-11-18 20:21:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:05,311 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-11-18 20:21:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 20:21:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-11-18 20:21:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:21:05,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:05,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:05,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:21:05,313 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-18 20:21:05,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1944636968, now seen corresponding path program 1 times [2022-11-18 20:21:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:05,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684939745] [2022-11-18 20:21:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684939745] [2022-11-18 20:21:06,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684939745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:21:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825108519] [2022-11-18 20:21:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:21:06,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:21:06,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:21:06,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:21:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:06,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-18 20:21:06,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:06,594 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:21:06,594 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-18 20:21:06,625 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-18 20:21:06,666 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-18 20:21:06,699 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-18 20:21:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:08,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:21:08,187 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 74 treesize of output 33 [2022-11-18 20:21:08,196 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-18 20:21:08,213 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-18 20:21:08,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:08,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:08,521 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 20:21:08,522 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 112 treesize of output 69 [2022-11-18 20:21:08,552 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-18 20:21:08,572 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-18 20:21:10,823 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-18 20:21:10,823 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 21 treesize of output 38 [2022-11-18 20:21:10,844 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-18 20:21:11,276 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 34 treesize of output 29 [2022-11-18 20:21:11,511 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-18 20:21:11,522 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-18 20:21:11,970 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-18 20:21:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:12,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:22,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825108519] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:22,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:21:22,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2022-11-18 20:21:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525015340] [2022-11-18 20:21:22,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:22,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:21:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:22,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:21:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=473, Unknown=19, NotChecked=0, Total=600 [2022-11-18 20:21:22,095 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 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-18 20:21:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:24,081 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-11-18 20:21:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:21:24,082 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 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-18 20:21:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:24,083 INFO L225 Difference]: With dead ends: 23 [2022-11-18 20:21:24,083 INFO L226 Difference]: Without dead ends: 22 [2022-11-18 20:21:24,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=254, Invalid=849, Unknown=19, NotChecked=0, Total=1122 [2022-11-18 20:21:24,085 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:24,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 60 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 0 Unknown, 37 Unchecked, 0.3s Time] [2022-11-18 20:21:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-18 20:21:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-18 20:21:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.1) internal successors, (22), 21 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-18 20:21:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-11-18 20:21:24,090 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2022-11-18 20:21:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:24,090 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-11-18 20:21:24,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 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-18 20:21:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-11-18 20:21:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:21:24,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:24,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-18 20:21:24,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 20:21:24,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 20:21:24,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:21:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -485350694, now seen corresponding path program 1 times [2022-11-18 20:21:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:24,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600763957] [2022-11-18 20:21:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:25,344 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-18 20:21:25,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:25,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600763957] [2022-11-18 20:21:25,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600763957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:21:25,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355285576] [2022-11-18 20:21:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:25,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:21:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:21:25,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:21:25,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:21:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:25,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:21:25,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:25,946 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:21:25,946 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-18 20:21:25,981 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-18 20:21:26,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-18 20:21:26,045 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-18 20:21:27,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:27,205 INFO L321 Elim1Store]: treesize reduction 99, result has 25.6 percent of original size [2022-11-18 20:21:27,205 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 370 treesize of output 358 [2022-11-18 20:21:27,258 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-18 20:21:27,625 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 20:21:27,625 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 122 treesize of output 47 [2022-11-18 20:21:27,721 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 222 treesize of output 214 [2022-11-18 20:21:30,216 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-18 20:21:30,216 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 28 treesize of output 47 [2022-11-18 20:21:30,245 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-18 20:21:30,263 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-18 20:21:30,624 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:21:30,624 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-18 20:21:30,646 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-18 20:21:30,869 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-18 20:21:31,420 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 19 treesize of output 18 [2022-11-18 20:21:31,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:31,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:21:31,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-11-18 20:21:31,754 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-18 20:21:31,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:36,411 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-18 20:21:36,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355285576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:36,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:21:36,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2022-11-18 20:21:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867355193] [2022-11-18 20:21:36,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:21:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:36,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:21:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=567, Unknown=28, NotChecked=0, Total=756 [2022-11-18 20:21:36,416 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 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-18 20:21:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:43,125 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-11-18 20:21:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:21:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 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-18 20:21:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:43,126 INFO L225 Difference]: With dead ends: 40 [2022-11-18 20:21:43,126 INFO L226 Difference]: Without dead ends: 39 [2022-11-18 20:21:43,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=324, Invalid=1043, Unknown=39, NotChecked=0, Total=1406 [2022-11-18 20:21:43,128 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:43,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-11-18 20:21:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-18 20:21:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-18 20:21:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-11-18 20:21:43,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 19 [2022-11-18 20:21:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:43,136 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-11-18 20:21:43,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 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-18 20:21:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-11-18 20:21:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:21:43,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:43,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-18 20:21:43,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:21:43,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:21:43,343 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:21:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2133997730, now seen corresponding path program 1 times [2022-11-18 20:21:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:43,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502522401] [2022-11-18 20:21:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:44,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502522401] [2022-11-18 20:21:44,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502522401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:21:44,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788938150] [2022-11-18 20:21:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:44,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:21:44,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:21:44,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:21:44,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:21:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:44,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 20:21:44,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:44,830 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:21:44,831 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-18 20:21:44,853 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-18 20:21:44,879 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-18 20:21:44,903 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-18 20:21:46,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:46,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:21:46,308 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 76 treesize of output 33 [2022-11-18 20:21:46,317 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-18 20:21:46,325 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-18 20:21:46,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:46,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:46,473 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 20:21:46,473 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 112 treesize of output 63 [2022-11-18 20:21:46,484 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-18 20:21:46,494 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-18 20:21:46,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 98 treesize of output 94 [2022-11-18 20:21:46,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:21:46,842 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:21:47,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:21:47,504 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 16 treesize of output 18 [2022-11-18 20:21:47,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:47,651 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-18 20:21:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:47,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:48,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))) is different from false [2022-11-18 20:21:48,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:21:48,061 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 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-18 20:21:48,069 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 69 treesize of output 61 [2022-11-18 20:21:48,078 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 56 treesize of output 52 [2022-11-18 20:21:48,087 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 26 treesize of output 24 [2022-11-18 20:21:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-18 20:21:48,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788938150] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:48,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:21:48,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-11-18 20:21:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955565198] [2022-11-18 20:21:48,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:48,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:21:48,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:21:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=304, Unknown=2, NotChecked=36, Total=420 [2022-11-18 20:21:48,623 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 21 states, 20 states have (on average 2.9) internal successors, (58), 21 states have internal predecessors, (58), 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-18 20:21:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:49,433 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-11-18 20:21:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:21:49,433 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:21:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:49,434 INFO L225 Difference]: With dead ends: 39 [2022-11-18 20:21:49,434 INFO L226 Difference]: Without dead ends: 38 [2022-11-18 20:21:49,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=138, Invalid=416, Unknown=2, NotChecked=44, Total=600 [2022-11-18 20:21:49,436 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:49,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 87 Invalid, 0 Unknown, 14 Unchecked, 0.3s Time] [2022-11-18 20:21:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-18 20:21:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-18 20:21:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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-18 20:21:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-11-18 20:21:49,442 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 20 [2022-11-18 20:21:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:49,443 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-11-18 20:21:49,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 21 states have internal predecessors, (58), 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-18 20:21:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-11-18 20:21:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:21:49,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:49,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2022-11-18 20:21:49,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:49,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:21:49,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:21:49,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash 263473658, now seen corresponding path program 2 times [2022-11-18 20:21:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:49,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025158176] [2022-11-18 20:21:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025158176] [2022-11-18 20:21:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025158176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:21:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188876715] [2022-11-18 20:21:51,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:21:51,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:21:51,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:21:51,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:21:51,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:21:51,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:21:51,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:21:51,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-18 20:21:51,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:51,328 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-18 20:21:51,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:51,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:51,433 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:21:51,434 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 1 case distinctions, treesize of input 17 treesize of output 23 [2022-11-18 20:21:51,443 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-18 20:21:51,630 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-18 20:21:51,691 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-18 20:21:51,828 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-18 20:21:51,954 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-18 20:21:52,021 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-18 20:21:52,161 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-18 20:21:52,284 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-18 20:21:52,349 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-18 20:21:52,489 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-18 20:21:52,592 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-18 20:21:52,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:21:52,633 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-18 20:21:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:52,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:52,728 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |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-18 20:21:55,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_563))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_564) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_564)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |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-18 20:21:55,428 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_561 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (let ((.cse0 (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_561)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_563))) (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_564)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |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_564) (not (<= v_ArrVal_561 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))))))) is different from false [2022-11-18 20:21:56,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_566 (Array Int 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_557)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_559))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_561)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_563))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_561) (< (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_564)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |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_564) (not (<= v_ArrVal_557 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))))))))) is different from false [2022-11-18 20:21:56,392 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_566 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_555))) (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_557)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_559))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_561)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_563))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_564) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_561) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_557) (< (select (select (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_564)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |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-18 20:21:56,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_555))) (let ((.cse1 (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 .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_557)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_559))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_561)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_563))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_564) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_557) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_564)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |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_561))))))))) is different from false [2022-11-18 20:21:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 10 times theorem prover too weak. 0 trivial. 35 not checked. [2022-11-18 20:21:56,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188876715] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:56,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:21:56,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 28 [2022-11-18 20:21:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146135864] [2022-11-18 20:21:56,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:56,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:21:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:21:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=356, Unknown=27, NotChecked=282, Total=812 [2022-11-18 20:21:56,759 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 29 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-18 20:22:01,707 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_566 (Array Int Int))) (or (< (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_564)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_564 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)))))) is different from false [2022-11-18 20:22:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:01,746 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-11-18 20:22:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:22:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 29 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) Word has length 37 [2022-11-18 20:22:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:01,747 INFO L225 Difference]: With dead ends: 66 [2022-11-18 20:22:01,748 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:22:01,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=253, Invalid=528, Unknown=59, NotChecked=420, Total=1260 [2022-11-18 20:22:01,749 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:01,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 60 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 174 Unchecked, 0.2s Time] [2022-11-18 20:22:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:22:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:22:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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-18 20:22:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-11-18 20:22:01,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 37 [2022-11-18 20:22:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:01,758 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-11-18 20:22:01,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 29 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-18 20:22:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-11-18 20:22:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:22:01,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:01,761 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1] [2022-11-18 20:22:01,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:01,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 20:22:01,967 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-18 20:22:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash 678764747, now seen corresponding path program 3 times [2022-11-18 20:22:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:22:01,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128503720] [2022-11-18 20:22:01,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:22:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:22:04,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128503720] [2022-11-18 20:22:04,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128503720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:04,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489402935] [2022-11-18 20:22:04,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:22:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:22:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:22:04,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:22:04,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:22:05,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-18 20:22:05,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:22:05,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-18 20:22:05,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:05,952 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:22:05,953 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-18 20:22:05,981 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-18 20:22:06,008 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-18 20:22:06,036 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-18 20:22:06,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:06,734 INFO L321 Elim1Store]: treesize reduction 69, result has 18.8 percent of original size [2022-11-18 20:22:06,735 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 246 treesize of output 255 [2022-11-18 20:22:06,799 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-18 20:22:06,940 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-18 20:22:07,070 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-18 20:22:07,255 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 20:22:07,255 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 85 treesize of output 16 [2022-11-18 20:22:07,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:22:07,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:22:07,282 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 16 [2022-11-18 20:22:09,460 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-18 20:22:09,461 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 28 treesize of output 47 [2022-11-18 20:22:09,780 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:22:09,780 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-18 20:22:09,969 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-18 20:22:10,261 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-18 20:22:10,341 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-18 20:22:10,521 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-18 20:22:10,834 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-18 20:22:10,897 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-18 20:22:11,116 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-18 20:22:11,459 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-18 20:22:11,541 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-18 20:22:11,752 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-18 20:22:12,074 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-18 20:22:12,150 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-18 20:22:12,375 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-18 20:22:12,662 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-18 20:22:12,725 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-18 20:22:12,945 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-18 20:22:13,235 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-18 20:22:13,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:13,418 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-18 20:22:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:13,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:13,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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-18 20:22:14,109 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_723) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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-18 20:22:14,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse0 (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_718 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723))))) is different from false [2022-11-18 20:22:16,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (let ((.cse1 (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 .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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_718))))))))) is different from false [2022-11-18 20:22:17,826 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_718 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_709))) (let ((.cse3 (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 .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (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_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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_723) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714))))))))))) is different from false [2022-11-18 20:22:18,909 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_718 Int) (v_ArrVal_706 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int 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_706)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_709))) (let ((.cse3 (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 .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (let ((.cse2 (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 .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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_723) (not (<= v_ArrVal_706 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718))))))))))) is different from false [2022-11-18 20:22:19,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_718 Int) (v_ArrVal_706 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_705))) (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_706)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_709))) (let ((.cse0 (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 .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (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_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (< (select (select (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_706))))))))))))) is different from false [2022-11-18 20:22:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 52 refuted. 71 times theorem prover too weak. 0 trivial. 60 not checked. [2022-11-18 20:22:28,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489402935] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:22:28,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:22:28,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 25] total 60 [2022-11-18 20:22:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999536793] [2022-11-18 20:22:28,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:28,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-18 20:22:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:22:28,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-18 20:22:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=2055, Unknown=159, NotChecked=770, Total=3660 [2022-11-18 20:22:28,182 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 61 states, 60 states have (on average 3.15) internal successors, (189), 61 states have internal predecessors, (189), 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-18 20:23:12,625 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 244 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:23:28,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))) (and (forall ((v_ArrVal_718 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (let ((.cse3 (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 .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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_723) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (not (<= v_ArrVal_710 .cse4)))))))))) (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_718 Int) (v_ArrVal_706 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_706)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_709))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (let ((.cse10 (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 .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (not (<= v_ArrVal_706 .cse4)) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718))))))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_718 .cse4)) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (not (<= v_ArrVal_714 .cse4)) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (< (select (select (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_723 .cse4)))))) is different from false [2022-11-18 20:23:28,717 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))) (and (forall ((v_ArrVal_718 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (let ((.cse3 (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 .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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_723) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (not (<= v_ArrVal_710 .cse4)))))))))) (forall ((v_ArrVal_718 Int) (v_ArrVal_706 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_710 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_706)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_709))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_710)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_712) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_713))) (let ((.cse10 (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 .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (not (<= v_ArrVal_706 .cse4)) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_714) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_710) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718))))))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_718 .cse4)) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_714 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_714)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (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_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (not (<= v_ArrVal_714 .cse4)) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (< (select (select (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_723 .cse4)))))) is different from false [2022-11-18 20:23:53,343 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_717))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_718) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_725 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_723) (< (select (select (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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-18 20:23:53,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))) (and (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_718 .cse2)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723))))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_723 .cse2)))))) is different from false [2022-11-18 20:23:53,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_718 Int) (v_ArrVal_723 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_718)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_718 .cse2)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_723))))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_723 .cse2)))))) is different from false [2022-11-18 20:23:57,756 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_725 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_721))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_723) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |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-18 20:23:57,772 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_723 Int)) (or (< (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_723)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_723 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 1)))))) is different from false [2022-11-18 20:23:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:57,810 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-11-18 20:23:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-18 20:23:57,811 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.15) internal successors, (189), 61 states have internal predecessors, (189), 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 64 [2022-11-18 20:23:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:57,812 INFO L225 Difference]: With dead ends: 129 [2022-11-18 20:23:57,812 INFO L226 Difference]: Without dead ends: 128 [2022-11-18 20:23:57,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 92 SyntacticMatches, 23 SemanticMatches, 84 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2362 ImplicationChecksByTransitivity, 105.0s TimeCoverageRelationStatistics Valid=1261, Invalid=3443, Unknown=464, NotChecked=2142, Total=7310 [2022-11-18 20:23:57,815 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 291 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 713 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:57,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 126 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 713 Unchecked, 0.3s Time] [2022-11-18 20:23:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-18 20:23:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-18 20:23:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0078740157480315) internal successors, (128), 127 states have internal predecessors, (128), 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-18 20:23:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2022-11-18 20:23:57,830 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 64 [2022-11-18 20:23:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:57,831 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2022-11-18 20:23:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.15) internal successors, (189), 61 states have internal predecessors, (189), 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-18 20:23:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2022-11-18 20:23:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-18 20:23:57,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:57,834 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1] [2022-11-18 20:23:57,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:23:58,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:23:58,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-18 20:23:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -249686630, now seen corresponding path program 4 times [2022-11-18 20:23:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:23:58,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071876027] [2022-11-18 20:23:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:23:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:24:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:24:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:24:04,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071876027] [2022-11-18 20:24:04,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071876027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:24:04,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826055078] [2022-11-18 20:24:04,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:24:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:24:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:24:04,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:24:04,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b45d07-22a0-450d-8006-2de927544c60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:24:05,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:24:05,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:24:05,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-18 20:24:05,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:24:05,608 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 20:24:05,609 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-18 20:24:05,639 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-18 20:24:05,668 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-18 20:24:05,696 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-18 20:24:06,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:24:06,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:24:06,464 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 20:24:06,464 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 96 treesize of output 57 [2022-11-18 20:24:06,473 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-18 20:24:06,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-18 20:24:06,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:24:06,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:24:06,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:24:06,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:24:06,633 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 102 treesize of output 62 [2022-11-18 20:24:06,643 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-18 20:24:06,652 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-18 20:24:09,418 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-18 20:24:09,419 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 28 treesize of output 47 [2022-11-18 20:24:09,430 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-18 20:24:09,449 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-18 20:24:09,805 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:24:09,806 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-18 20:24:09,824 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-18 20:24:10,054 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-18 20:24:10,450 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-18 20:24:10,596 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-18 20:24:10,812 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-18 20:24:11,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 14 treesize of output 16 [2022-11-18 20:24:11,349 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-18 20:24:11,616 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-18 20:24:12,021 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-18 20:24:12,135 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-18 20:24:12,397 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-18 20:24:12,812 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-18 20:24:12,954 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-18 20:24:13,228 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-18 20:24:13,622 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-18 20:24:13,735 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-18 20:24:14,037 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-18 20:24:14,459 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-18 20:24:14,546 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-18 20:24:14,896 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-18 20:24:15,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-18 20:24:15,477 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-18 20:24:15,734 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-18 20:24:16,169 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-18 20:24:16,288 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-18 20:24:16,601 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-18 20:24:17,033 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-18 20:24:17,174 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-18 20:24:17,497 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-18 20:24:17,963 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-18 20:24:18,053 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-18 20:24:18,373 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-18 20:24:18,867 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-18 20:24:19,003 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-18 20:24:19,330 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-18 20:24:19,810 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-18 20:24:19,894 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-18 20:24:20,224 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-18 20:24:21,021 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 19 treesize of output 18 [2022-11-18 20:24:21,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:24:21,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:24:21,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-11-18 20:24:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:24:21,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 134 refuted. 672 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:25:56,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826055078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:25:56,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:25:56,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35, 47] total 111 [2022-11-18 20:25:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805718604] [2022-11-18 20:25:56,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-11-18 20:25:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-11-18 20:25:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2821, Invalid=8280, Unknown=1331, NotChecked=0, Total=12432 [2022-11-18 20:25:56,051 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand has 112 states, 111 states have (on average 3.4054054054054053) internal successors, (378), 112 states have internal predecessors, (378), 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-18 20:26:09,280 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse2 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse4 (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 .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse1 (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 .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store (store (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse0 (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 .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (select (select (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |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_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)))))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int)) (and (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (<= (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 2147483647))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse21 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse17 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store (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_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse19 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (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_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse20 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse18 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (select (select (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993))))))))))))))))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_968 Int) (v_ArrVal_945 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_943))) (let ((.cse42 (select .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse59 (store (store (store .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_945)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_947))) (let ((.cse46 (select .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse58 (store (store (store .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_949)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_951))) (let ((.cse32 (select .cse58 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse57 (store (store (store .cse58 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_952)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse33 (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse56 (store (store (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse40 (select .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse55 (store (store (store .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse35 (select .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse54 (store (store (store .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse36 (select .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse53 (store (store (store .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse37 (select .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse52 (store (store (store .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse41 (select .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse51 (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse44 (select .cse51 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse50 (store (store (store .cse51 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse44 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse39 (select .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse49 (store (store (store .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse38 (select .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse48 (store (store (store .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse43 (select .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse45 (let ((.cse47 (store .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse34 (select .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_952) (< (+ (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_945) (< (+ (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< 2147483647 v_ArrVal_995) (< (+ (select .cse44 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_949))))))))))))))))))))))))))))))) (forall ((v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse64 (select .cse69 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse68 (store (store (store .cse69 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse64 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse61 (select .cse68 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse67 (store (store (store .cse68 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse65 (select .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse62 (let ((.cse66 (store .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (select (select (store .cse62 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse63 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse63 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse64 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993))))))))))) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_952 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_951))) (let ((.cse75 (select .cse94 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse93 (store (store (store .cse94 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_952)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse71 (select .cse93 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse92 (store (store (store .cse93 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse78 (select .cse92 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse91 (store (store (store .cse92 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse78 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse80 (select .cse91 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse90 (store (store (store .cse91 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse79 (select .cse90 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse89 (store (store (store .cse90 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse79 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse81 (select .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse88 (store (store (store .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse72 (select .cse88 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse87 (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse72 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse70 (select .cse87 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse86 (store (store (store .cse87 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse70 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse82 (select .cse86 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse85 (store (store (store .cse86 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse82 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse76 (select .cse85 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse84 (store (store (store .cse85 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse76 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse77 (select .cse84 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse73 (let ((.cse83 (store .cse84 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse83 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse70 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< (+ (select .cse72 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (select (select (store .cse73 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse74 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_952) (< (+ (select .cse76 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse78 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse79 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse82 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (select .cse74 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)))))))))))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse97 (select .cse113 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse112 (store (store (store .cse113 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse97 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse98 (select .cse112 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse111 (store (store (store .cse112 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse98 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse103 (select .cse111 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse110 (store (store (store .cse111 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse103 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse104 (select .cse110 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse109 (store (store (store .cse110 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse104 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse102 (select .cse109 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse108 (store (store (store .cse109 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse102 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse96 (select .cse108 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse107 (store (store (store .cse108 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse96 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse95 (select .cse107 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse106 (store (store (store .cse107 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse95 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse100 (select .cse106 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse101 (let ((.cse105 (store .cse106 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse100 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse105 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse99 (select .cse101 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse95 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse96 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse97 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse98 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (select .cse99 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse100 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (select (select (store .cse101 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse99 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_995) (< (+ (select .cse102 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse103 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse104 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976))))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse126 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse118 (select .cse126 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse125 (store (store (store .cse126 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse118 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse115 (select .cse125 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse124 (store (store (store .cse125 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse115 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse114 (select .cse124 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse123 (store (store (store .cse124 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse114 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse119 (select .cse123 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse122 (store (store (store .cse123 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse119 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse120 (select .cse122 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse116 (let ((.cse121 (store .cse122 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse120 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ 1 (select .cse114 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_984) (< (+ (select .cse115 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse116 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse117 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse118 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse119 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (select .cse117 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse120 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< 2147483647 v_ArrVal_995))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int))) (let ((.cse147 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse136 (select .cse147 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse146 (store (store (store .cse147 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse136 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse130 (select .cse146 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse145 (store (store (store .cse146 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse130 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse137 (select .cse145 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse144 (store (store (store .cse145 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse137 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse129 (select .cse144 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse143 (store (store (store .cse144 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse129 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse131 (select .cse143 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse142 (store (store (store .cse143 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse131 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse135 (select .cse142 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse141 (store (store (store .cse142 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse135 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse128 (select .cse141 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse140 (store (store (store .cse141 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse128 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse134 (select .cse140 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse139 (store (store (store .cse140 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse134 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse127 (select .cse139 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse132 (let ((.cse138 (store .cse139 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse127 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse138 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse133 (select .cse132 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse127 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse128 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse129 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse130 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse131 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (select (select (store .cse132 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse133 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_995) (< (+ (select .cse134 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse135 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse136 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse137 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (select .cse133 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)))))))))))))))))))))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse174 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_947))) (let ((.cse154 (select .cse174 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse173 (store (store (store .cse174 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse154 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_949)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_951))) (let ((.cse148 (select .cse173 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse172 (store (store (store .cse173 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse148 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_952)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse156 (select .cse172 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse171 (store (store (store .cse172 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse156 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse159 (select .cse171 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse170 (store (store (store .cse171 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse159 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse155 (select .cse170 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse169 (store (store (store .cse170 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse155 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse160 (select .cse169 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse168 (store (store (store .cse169 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse160 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse150 (select .cse168 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse167 (store (store (store .cse168 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse150 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse149 (select .cse167 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse166 (store (store (store .cse167 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse149 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse153 (select .cse166 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse165 (store (store (store .cse166 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse153 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse151 (select .cse165 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse164 (store (store (store .cse165 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse151 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse161 (select .cse164 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse163 (store (store (store .cse164 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse161 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse152 (select .cse163 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse157 (let ((.cse162 (store .cse163 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse152 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse162 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse162 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse158 (select .cse157 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse148 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_952) (< (+ (select .cse149 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse150 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ 1 (select .cse151 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_984) (< (+ (select .cse152 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse153 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse154 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_949) (< (+ (select .cse155 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse156 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< 2147483647 v_ArrVal_995) (< (select (select (store .cse157 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse158 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse159 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse160 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (select .cse158 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse161 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989))))))))))))))))))))))))))))) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse181 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse175 (select .cse181 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse180 (store (store (store .cse181 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse175 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse178 (select .cse180 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse176 (let ((.cse179 (store .cse180 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse178 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse179 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse179 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse177 (select .cse176 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse175 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (select (select (store .cse176 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse177 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_995) (< (select .cse177 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse178 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993))))))))) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| (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|)) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse186 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse182 (select .cse186 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse184 (let ((.cse185 (store .cse186 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse182 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse185 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse185 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse183 (select .cse184 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse182 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (select .cse183 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< 2147483647 v_ArrVal_995) (< (select (select (store .cse184 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse183 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse209 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse192 (select .cse209 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse208 (store (store (store .cse209 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse192 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse195 (select .cse208 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse207 (store (store (store .cse208 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse195 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse187 (select .cse207 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse206 (store (store (store .cse207 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse187 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse197 (select .cse206 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse205 (store (store (store .cse206 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse197 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse198 (select .cse205 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse204 (store (store (store .cse205 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse198 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse196 (select .cse204 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse203 (store (store (store .cse204 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse196 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse188 (select .cse203 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse202 (store (store (store .cse203 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse188 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse194 (select .cse202 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse201 (store (store (store .cse202 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse194 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse191 (select .cse201 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse200 (store (store (store .cse201 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse191 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse193 (select .cse200 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse189 (let ((.cse199 (store .cse200 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse193 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse199 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse199 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse190 (select .cse189 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse187 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse188 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse189 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse190 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse191 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse192 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< (+ (select .cse193 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (select .cse190 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse194 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse195 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse196 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< 2147483647 v_ArrVal_995) (< (+ (select .cse197 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse198 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973))))))))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int))) (let ((.cse220 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse214 (select .cse220 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse219 (store (store (store .cse220 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse214 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse213 (select .cse219 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse218 (store (store (store .cse219 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse213 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse212 (select .cse218 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse217 (store (store (store .cse218 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse212 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse211 (select .cse217 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse215 (let ((.cse216 (store .cse217 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse211 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse216 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse216 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse210 (select .cse215 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (select .cse210 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse211 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse212 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse213 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse214 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse215 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse210 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 13)) is different from true [2022-11-18 20:26:51,670 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 901 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:28:08,925 WARN L233 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 843 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:29:29,037 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification that was a NOOP. DAG size: 849 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:29:31,144 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse2 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse4 (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 .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse1 (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 .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store (store (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse0 (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 .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (select (select (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |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_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse21 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse17 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store (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_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse19 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (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_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse20 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse18 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (select (select (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993))))))))))))))))) (forall ((v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse39 (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse32 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse38 (store (store (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse33 (let ((.cse37 (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (select (select (store .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993))))))))))) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_952 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_951))) (let ((.cse46 (select .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse64 (store (store (store .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_952)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse42 (select .cse64 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse63 (store (store (store .cse64 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse49 (select .cse63 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse62 (store (store (store .cse63 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse51 (select .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse61 (store (store (store .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse51 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse50 (select .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse60 (store (store (store .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse52 (select .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse59 (store (store (store .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse43 (select .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse58 (store (store (store .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse41 (select .cse58 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse57 (store (store (store .cse58 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse53 (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse56 (store (store (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse47 (select .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse55 (store (store (store .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse48 (select .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse44 (let ((.cse54 (store .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< (+ (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (select (select (store .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_952) (< (+ (select .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse51 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (select .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)))))))))))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse68 (select .cse84 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse83 (store (store (store .cse84 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse68 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse69 (select .cse83 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse82 (store (store (store .cse83 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse69 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse74 (select .cse82 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse81 (store (store (store .cse82 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse74 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse75 (select .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse80 (store (store (store .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse73 (select .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse79 (store (store (store .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse67 (select .cse79 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse78 (store (store (store .cse79 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse66 (select .cse78 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse77 (store (store (store .cse78 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse66 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse71 (select .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse72 (let ((.cse76 (store .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse70 (select .cse72 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse66 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse68 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse69 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (select .cse70 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (select (select (store .cse72 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse70 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_995) (< (+ (select .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse74 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976))))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse89 (select .cse97 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse96 (store (store (store .cse97 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse86 (select .cse96 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse95 (store (store (store .cse96 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse86 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse85 (select .cse95 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse94 (store (store (store .cse95 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse85 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse90 (select .cse94 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse93 (store (store (store .cse94 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse90 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse91 (select .cse93 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse87 (let ((.cse92 (store .cse93 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse91 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse92 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse92 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse88 (select .cse87 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ 1 (select .cse85 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_984) (< (+ (select .cse86 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse87 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse90 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (select .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse91 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< 2147483647 v_ArrVal_995))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int))) (let ((.cse118 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse107 (select .cse118 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse117 (store (store (store .cse118 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse107 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse101 (select .cse117 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse116 (store (store (store .cse117 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse101 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse108 (select .cse116 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse115 (store (store (store .cse116 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse108 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse100 (select .cse115 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse114 (store (store (store .cse115 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse100 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse102 (select .cse114 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse113 (store (store (store .cse114 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse102 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse106 (select .cse113 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse112 (store (store (store .cse113 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse106 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse99 (select .cse112 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse111 (store (store (store .cse112 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse99 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse105 (select .cse111 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse110 (store (store (store .cse111 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse105 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse98 (select .cse110 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse103 (let ((.cse109 (store .cse110 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse98 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse104 (select .cse103 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse98 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse99 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse100 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ (select .cse101 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse102 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (select (select (store .cse103 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse104 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_995) (< (+ (select .cse105 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse106 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse107 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse108 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (select .cse104 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)))))))))))))))))))))))) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse145 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_947))) (let ((.cse125 (select .cse145 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse144 (store (store (store .cse145 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse125 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_949)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_951))) (let ((.cse119 (select .cse144 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse143 (store (store (store .cse144 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse119 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_952)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse127 (select .cse143 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse142 (store (store (store .cse143 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse127 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse130 (select .cse142 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse141 (store (store (store .cse142 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse130 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse126 (select .cse141 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse140 (store (store (store .cse141 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse126 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse131 (select .cse140 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse139 (store (store (store .cse140 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse131 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse121 (select .cse139 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse138 (store (store (store .cse139 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse121 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse120 (select .cse138 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse137 (store (store (store .cse138 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse120 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse124 (select .cse137 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse136 (store (store (store .cse137 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse124 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse122 (select .cse136 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse135 (store (store (store .cse136 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse122 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse132 (select .cse135 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse134 (store (store (store .cse135 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse132 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse123 (select .cse134 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse128 (let ((.cse133 (store .cse134 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse123 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse133 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse133 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse129 (select .cse128 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse119 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_952) (< (+ (select .cse120 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< (+ (select .cse121 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973) (< (+ 1 (select .cse122 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_984) (< (+ (select .cse123 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse124 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (+ (select .cse125 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_949) (< (+ (select .cse126 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse127 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< 2147483647 v_ArrVal_995) (< (select (select (store .cse128 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse129 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse130 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse131 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (select .cse129 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse132 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989))))))))))))))))))))))))))))) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse152 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse146 (select .cse152 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse151 (store (store (store .cse152 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse146 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse149 (select .cse151 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse147 (let ((.cse150 (store .cse151 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse149 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse150 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse150 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse148 (select .cse147 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse146 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (select (select (store .cse147 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse148 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_995) (< (select .cse148 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse149 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993))))))))) (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse157 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse153 (select .cse157 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse155 (let ((.cse156 (store .cse157 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse153 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse156 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse156 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse154 (select .cse155 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse153 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (select .cse154 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< 2147483647 v_ArrVal_995) (< (select (select (store .cse155 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse154 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_957 Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_976 Int) (v_ArrVal_997 Int) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 Int) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_968 Int) (v_ArrVal_989 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_973 Int) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_974 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_ArrVal_993 Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse180 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_955))) (let ((.cse163 (select .cse180 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse179 (store (store (store .cse180 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse163 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_957)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_959))) (let ((.cse166 (select .cse179 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse178 (store (store (store .cse179 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse166 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_963))) (let ((.cse158 (select .cse178 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse177 (store (store (store .cse178 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse158 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_965)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_966) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_967))) (let ((.cse168 (select .cse177 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse176 (store (store (store .cse177 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse168 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_968)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_971))) (let ((.cse169 (select .cse176 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse175 (store (store (store .cse176 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse169 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_973)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_974) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_975))) (let ((.cse167 (select .cse175 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse174 (store (store (store .cse175 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse167 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse159 (select .cse174 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse173 (store (store (store .cse174 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse159 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse165 (select .cse173 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse172 (store (store (store .cse173 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse165 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse162 (select .cse172 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse171 (store (store (store .cse172 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse162 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse164 (select .cse171 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse160 (let ((.cse170 (store .cse171 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse164 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse170 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse170 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse161 (select .cse160 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (+ (select .cse158 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_965) (< (+ (select .cse159 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse160 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse161 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse162 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse163 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_957) (< (+ (select .cse164 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (select .cse161 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse165 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< (+ (select .cse166 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_960) (< (+ (select .cse167 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_976) (< 2147483647 v_ArrVal_995) (< (+ (select .cse168 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_968) (< (+ (select .cse169 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_973))))))))))))))))))))))))) (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_989 Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_997 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_984 Int) (v_ArrVal_986 (Array Int Int)) (v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_981 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_979 (Array Int Int))) (let ((.cse191 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_979))) (let ((.cse185 (select .cse191 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse190 (store (store (store .cse191 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse185 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_981)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_983))) (let ((.cse184 (select .cse190 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse189 (store (store (store .cse190 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse184 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_984)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_987))) (let ((.cse183 (select .cse189 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse188 (store (store (store .cse189 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse183 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_991))) (let ((.cse182 (select .cse188 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse186 (let ((.cse187 (store .cse188 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse182 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_993)))) (store .cse187 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse187 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_995))))) (let ((.cse181 (select .cse186 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (< (select .cse181 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ v_ArrVal_997 1)) (< (+ (select .cse182 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_993) (< (+ (select .cse183 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_989) (< (+ (select .cse184 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_984) (< 2147483647 v_ArrVal_995) (< (+ (select .cse185 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_981) (< (select (select (store .cse186 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse181 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))) (forall ((v_ArrVal_997 Int)) (or (< (select (select (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_997)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= (+ v_ArrVal_997 1) |c_ULTIMATE.start_test_fun_#t~mem9#1|))))) is different from true [2022-11-18 20:30:17,358 WARN L233 SmtUtils]: Spent 11.84s on a formula simplification that was a NOOP. DAG size: 785 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:31:34,834 WARN L233 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 731 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:33:03,713 WARN L233 SmtUtils]: Spent 10.33s on a formula simplification that was a NOOP. DAG size: 737 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:35:06,729 WARN L233 SmtUtils]: Spent 11.57s on a formula simplification that was a NOOP. DAG size: 717 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)