./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a --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 e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:29:47,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:29:47,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:29:47,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:29:47,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:29:47,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:29:47,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:29:47,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:29:47,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:29:47,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:29:47,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:29:47,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:29:47,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:29:47,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:29:47,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:29:47,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:29:47,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:29:47,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:29:47,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:29:47,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:29:47,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:29:47,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:29:47,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:29:47,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:29:47,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:29:47,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:29:47,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:29:47,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:29:47,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:29:47,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:29:47,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:29:47,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:29:47,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:29:47,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:29:47,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:29:47,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:29:47,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:29:47,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:29:47,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:29:47,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:29:47,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:29:47,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 16:29:47,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:29:47,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:29:47,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:29:47,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:29:47,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:29:47,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:29:47,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:29:47,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:29:47,297 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:29:47,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:29:47,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:29:47,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:29:47,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:29:47,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:29:47,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:29:47,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:29:47,300 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 16:29:47,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:29:47,300 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:29:47,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:29:47,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:29:47,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:29:47,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:29:47,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:29:47,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:29:47,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:29:47,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:29:47,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:29:47,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:29:47,302 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:29:47,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:29:47,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:29:47,303 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_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/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_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a 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 -> e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 [2022-11-21 16:29:47,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:29:47,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:29:47,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:29:47,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:29:47,616 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:29:47,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2022-11-21 16:29:50,636 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:29:51,001 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:29:51,005 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2022-11-21 16:29:51,017 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/data/7dbab5258/a2055eb6424b4dd9a88e5b24d074939a/FLAG128d52fbe [2022-11-21 16:29:51,037 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/data/7dbab5258/a2055eb6424b4dd9a88e5b24d074939a [2022-11-21 16:29:51,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:29:51,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:29:51,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:29:51,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:29:51,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:29:51,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b74b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51, skipping insertion in model container [2022-11-21 16:29:51,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:29:51,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:29:51,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:29:51,508 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:29:51,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:29:51,595 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:29:51,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51 WrapperNode [2022-11-21 16:29:51,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:29:51,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:29:51,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:29:51,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:29:51,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,652 INFO L138 Inliner]: procedures = 111, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2022-11-21 16:29:51,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:29:51,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:29:51,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:29:51,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:29:51,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,708 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:29:51,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:29:51,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:29:51,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:29:51,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (1/1) ... [2022-11-21 16:29:51,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:29:51,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:29:51,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:29:51,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:29:51,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:29:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:29:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:29:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:29:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:29:51,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:29:51,913 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:29:51,915 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:29:52,142 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:29:52,147 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:29:52,148 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 16:29:52,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:29:52 BoogieIcfgContainer [2022-11-21 16:29:52,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:29:52,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:29:52,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:29:52,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:29:52,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:29:51" (1/3) ... [2022-11-21 16:29:52,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4038251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:29:52, skipping insertion in model container [2022-11-21 16:29:52,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:29:51" (2/3) ... [2022-11-21 16:29:52,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4038251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:29:52, skipping insertion in model container [2022-11-21 16:29:52,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:29:52" (3/3) ... [2022-11-21 16:29:52,175 INFO L112 eAbstractionObserver]: Analyzing ICFG b.13-alloca.i [2022-11-21 16:29:52,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:29:52,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-21 16:29:52,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:29:52,254 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;@22377558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:29:52,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 16:29:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 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-21 16:29:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 16:29:52,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:52,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:52,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849165, now seen corresponding path program 1 times [2022-11-21 16:29:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:52,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896250786] [2022-11-21 16:29:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:52,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:53,570 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-21 16:29:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:53,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896250786] [2022-11-21 16:29:53,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896250786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:53,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:53,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:29:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993171522] [2022-11-21 16:29:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:53,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:29:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:29:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:29:53,610 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 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.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:53,741 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-11-21 16:29:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:29:53,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 16:29:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:53,752 INFO L225 Difference]: With dead ends: 60 [2022-11-21 16:29:53,752 INFO L226 Difference]: Without dead ends: 39 [2022-11-21 16:29:53,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:29:53,758 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:53,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:29:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-21 16:29:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 21. [2022-11-21 16:29:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-11-21 16:29:53,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 7 [2022-11-21 16:29:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:53,792 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-21 16:29:53,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-11-21 16:29:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 16:29:53,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:53,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:53,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:29:53,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:53,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash 177749322, now seen corresponding path program 1 times [2022-11-21 16:29:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:53,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862093001] [2022-11-21 16:29:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:54,464 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-21 16:29:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:54,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862093001] [2022-11-21 16:29:54,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862093001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:54,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:54,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:29:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612282299] [2022-11-21 16:29:54,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:54,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:29:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:54,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:29:54,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:29:54,469 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-21 16:29:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:54,605 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-11-21 16:29:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:29:54,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-21 16:29:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:54,608 INFO L225 Difference]: With dead ends: 40 [2022-11-21 16:29:54,608 INFO L226 Difference]: Without dead ends: 39 [2022-11-21 16:29:54,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:29:54,616 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:54,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 23 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:29:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-21 16:29:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-11-21 16:29:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 33 states have internal predecessors, (47), 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-21 16:29:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-11-21 16:29:54,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 8 [2022-11-21 16:29:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:54,632 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-11-21 16:29:54,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-21 16:29:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-11-21 16:29:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 16:29:54,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:54,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:54,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:29:54,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 177755312, now seen corresponding path program 1 times [2022-11-21 16:29:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:54,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400648334] [2022-11-21 16:29:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:29:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400648334] [2022-11-21 16:29:54,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400648334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:54,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:54,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:29:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685770567] [2022-11-21 16:29:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:54,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:29:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:29:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:29:54,784 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-21 16:29:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:54,831 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-11-21 16:29:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:29:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-21 16:29:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:54,834 INFO L225 Difference]: With dead ends: 61 [2022-11-21 16:29:54,834 INFO L226 Difference]: Without dead ends: 29 [2022-11-21 16:29:54,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-21 16:29:54,841 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:54,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:29:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-21 16:29:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-11-21 16:29:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 27 states have internal predecessors, (35), 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-21 16:29:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-11-21 16:29:54,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 8 [2022-11-21 16:29:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:54,852 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-11-21 16:29:54,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-21 16:29:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-11-21 16:29:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 16:29:54,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:54,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:54,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:29:54,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 179596364, now seen corresponding path program 1 times [2022-11-21 16:29:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:54,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991567024] [2022-11-21 16:29:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:54,959 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-21 16:29:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:54,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991567024] [2022-11-21 16:29:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991567024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:54,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:54,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:29:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768351728] [2022-11-21 16:29:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:29:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:29:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:29:54,962 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-21 16:29:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:55,016 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-11-21 16:29:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:29:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-21 16:29:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:55,019 INFO L225 Difference]: With dead ends: 58 [2022-11-21 16:29:55,020 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 16:29:55,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-21 16:29:55,025 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:55,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:29:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 16:29:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-11-21 16:29:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 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-21 16:29:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-21 16:29:55,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2022-11-21 16:29:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:55,029 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-21 16:29:55,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-21 16:29:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-21 16:29:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 16:29:55,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:55,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:55,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:29:55,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 179602354, now seen corresponding path program 1 times [2022-11-21 16:29:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758167556] [2022-11-21 16:29:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:55,691 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-21 16:29:55,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:55,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758167556] [2022-11-21 16:29:55,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758167556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:55,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:55,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:29:55,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408310224] [2022-11-21 16:29:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:55,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:29:55,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:29:55,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:29:55,694 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-21 16:29:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:55,780 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-11-21 16:29:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:29:55,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-21 16:29:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:55,782 INFO L225 Difference]: With dead ends: 53 [2022-11-21 16:29:55,782 INFO L226 Difference]: Without dead ends: 52 [2022-11-21 16:29:55,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:29:55,783 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:55,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:29:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-21 16:29:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 31. [2022-11-21 16:29:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-21 16:29:55,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 8 [2022-11-21 16:29:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:55,790 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-21 16:29:55,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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-21 16:29:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-21 16:29:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:29:55,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:55,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:55,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:29:55,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1272705742, now seen corresponding path program 1 times [2022-11-21 16:29:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:55,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437879124] [2022-11-21 16:29:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:56,216 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-21 16:29:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437879124] [2022-11-21 16:29:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437879124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:56,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:56,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:29:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805098271] [2022-11-21 16:29:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:56,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:29:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:29:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:29:56,218 INFO L87 Difference]: Start difference. First operand 31 states and 36 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-21 16:29:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:29:56,296 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-11-21 16:29:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:29:56,296 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-21 16:29:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:29:56,297 INFO L225 Difference]: With dead ends: 33 [2022-11-21 16:29:56,297 INFO L226 Difference]: Without dead ends: 32 [2022-11-21 16:29:56,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:29:56,298 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:29:56,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 19 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:29:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-21 16:29:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-11-21 16:29:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 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-21 16:29:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-11-21 16:29:56,303 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 9 [2022-11-21 16:29:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:29:56,303 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-11-21 16:29:56,304 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-21 16:29:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-11-21 16:29:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:29:56,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:29:56,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:56,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:29:56,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:29:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash 550336314, now seen corresponding path program 1 times [2022-11-21 16:29:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:56,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139157978] [2022-11-21 16:29:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:29:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:57,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139157978] [2022-11-21 16:29:57,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139157978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:57,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640966948] [2022-11-21 16:29:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:29:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:29:57,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:29:57,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:29:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:57,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 16:29:57,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:58,521 INFO L321 Elim1Store]: treesize reduction 357, result has 33.8 percent of original size [2022-11-21 16:29:58,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 2630 treesize of output 1394 [2022-11-21 16:29:59,033 INFO L217 Elim1Store]: Index analysis took 383 ms [2022-11-21 16:29:59,308 INFO L321 Elim1Store]: treesize reduction 336, result has 6.9 percent of original size [2022-11-21 16:29:59,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 23 case distinctions, treesize of input 178 treesize of output 356 [2022-11-21 16:29:59,437 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-21 16:29:59,565 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-21 16:29:59,658 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-21 16:30:00,268 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-21 16:30:02,797 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 88 treesize of output 95 [2022-11-21 16:30:02,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:02,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-21 16:30:02,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:02,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-21 16:30:06,064 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 3357 treesize of output 3341 [2022-11-21 16:30:08,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:08,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:08,049 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 95 treesize of output 88 [2022-11-21 16:30:08,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:08,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:08,904 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 95 treesize of output 88 [2022-11-21 16:30:08,954 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-21 16:30:08,967 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-21 16:30:11,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:11,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:11,269 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 95 treesize of output 88 [2022-11-21 16:30:11,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:30:24,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:24,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:24,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:24,286 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-21 16:30:24,290 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 49169 treesize of output 48898 [2022-11-21 16:30: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 7 treesize of output 5 [2022-11-21 16:30:31,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:31,622 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 11 treesize of output 9 [2022-11-21 16:30:31,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:31,648 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 11 treesize of output 9 [2022-11-21 16:30:34,671 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-21 16:30:35,144 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-21 16:30:35,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:30:35,165 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 11 treesize of output 9 [2022-11-21 16:30:35,284 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 30 treesize of output 24 [2022-11-21 16:30:35,312 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 74 treesize of output 66 [2022-11-21 16:30:35,338 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 30 treesize of output 24 [2022-11-21 16:30:39,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:39,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:39,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:30:39,678 INFO L321 Elim1Store]: treesize reduction 56, result has 12.5 percent of original size [2022-11-21 16:30:39,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3107 treesize of output 2974 [2022-11-21 16:30:39,785 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 2794 treesize of output 2736 [2022-11-21 16:30:39,855 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 2732 treesize of output 2730 [2022-11-21 16:30:39,918 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 2730 treesize of output 2728 [2022-11-21 16:30:39,994 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 2728 treesize of output 2726 [2022-11-21 16:30:40,081 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 2726 treesize of output 2724 [2022-11-21 16:30:40,199 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 2724 treesize of output 2722 [2022-11-21 16:30:40,281 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 2722 treesize of output 2720 [2022-11-21 16:30:40,374 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 2720 treesize of output 2718 [2022-11-21 16:30:40,486 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 2718 treesize of output 2716 [2022-11-21 16:30:40,597 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 2716 treesize of output 2714 [2022-11-21 16:30:40,731 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 2714 treesize of output 2712 [2022-11-21 16:30:40,913 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 2712 treesize of output 2710 [2022-11-21 16:30:41,107 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 2710 treesize of output 2708 [2022-11-21 16:30:41,391 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 2708 treesize of output 2706 [2022-11-21 16:30:41,649 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 2706 treesize of output 2704 [2022-11-21 16:30:41,876 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 2704 treesize of output 2702 [2022-11-21 16:30:42,116 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 2702 treesize of output 2700 [2022-11-21 16:30:46,197 INFO L321 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2022-11-21 16:30:46,200 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 41494 treesize of output 41081 [2022-11-21 16:30:50,053 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-21 16:30:50,075 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-21 16:30:50,126 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-21 16:30:50,155 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-21 16:30:52,228 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-21 16:30:52,242 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-21 16:30:52,260 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-21 16:30:52,284 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-21 16:30:52,412 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-21 16:30:52,422 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-21 16:31:17,178 WARN L233 SmtUtils]: Spent 21.79s on a formula simplification. DAG size of input: 958 DAG size of output: 852 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:31:42,205 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 854 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:31:47,210 INFO L321 Elim1Store]: treesize reduction 100, result has 40.8 percent of original size [2022-11-21 16:31:47,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 17941 treesize of output 16536 [2022-11-21 16:31:59,830 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-21 16:31:59,934 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-21 16:32:00,803 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 109 treesize of output 106 [2022-11-21 16:32:00,888 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:32:01,048 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 92 treesize of output 89 [2022-11-21 16:32:01,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:01,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-11-21 16:32:01,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:32:01,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-11-21 16:32:01,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:01,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-21 16:32:01,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:32:01,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-11-21 16:32:02,381 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:32:02,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 16:32:02,535 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-21 16:32:02,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:32:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:32:03,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640966948] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:32:03,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:32:03,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-11-21 16:32:03,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914394156] [2022-11-21 16:32:03,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 16:32:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:32:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 16:32:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=201, Unknown=2, NotChecked=0, Total=272 [2022-11-21 16:32:03,105 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 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-21 16:32:05,705 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse186 (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse3 (<= .cse186 2147483647))) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not .cse0) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (or (<= (select .cse1 0) 0) (and (<= (select .cse2 0) 0) .cse3) (and (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (exists ((v_prenex_3258 Int) (v_prenex_3261 Int)) (let ((.cse4 (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_3258) 0 v_prenex_3261) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= .cse4 0) (= v_prenex_3258 .cse4) (= (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0) .cse4)))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~c~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) .cse3) (and (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (<= (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (not (= |ULTIMATE.start_test_fun_~c~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) .cse0) (let ((.cse89 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (select .cse89 0))) (and (<= .cse5 0) (let ((.cse102 (select .cse89 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse88 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (or (and (let ((.cse18 (exists ((v_prenex_161 (Array Int Int)) (v_prenex_75 (Array Int Int)) (v_prenex_162 (Array Int Int)) (v_prenex_74 (Array Int Int))) (let ((.cse117 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_75) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_74) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_75) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_74) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse118 (select .cse117 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse119 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_161) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_162) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_161) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_162) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= (select .cse117 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_75) (= .cse118 .cse2) (= .cse118 (select .cse119 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse119 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_161)))))) (.cse44 (exists ((v_prenex_71 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse116 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse113 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_71) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_70) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_71) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_70) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse115 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse114 (select .cse113 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse112 (select .cse116 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= v_DerPreprocessor_22 .cse112) (= (select .cse113 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_71) (= .cse114 (select .cse115 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_32 (select .cse115 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse114 (select .cse116 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse1 .cse112)))))) (.cse43 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_161 (Array Int Int)) (v_prenex_75 (Array Int Int)) (v_prenex_162 (Array Int Int)) (v_prenex_74 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse108 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_75) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_74) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_75) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_74) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse110 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_161) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_162) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_161) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_162) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse109 (select .cse108 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse111 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= (select .cse108 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_75) (= .cse109 .cse2) (= .cse109 (select .cse110 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_32 (select .cse111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse110 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_161) (= .cse109 (select .cse111 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))))))) (.cse42 (exists ((v_prenex_170 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_165 (Array Int Int)) (v_prenex_166 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_169 (Array Int Int))) (let ((.cse107 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_165) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_166) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_165) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_166) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse103 (select .cse107 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse104 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_169) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_170) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_169) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_170) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse106 (select .cse107 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse105 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= .cse1 .cse103) (= (select .cse104 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_169) (= v_prenex_165 .cse103) (= v_DerPreprocessor_32 (select .cse105 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse106 (select .cse104 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse106 (select .cse105 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))))))) (.cse16 (= .cse89 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse102) 0 .cse5))) (.cse28 (exists ((v_prenex_170 (Array Int Int)) (v_prenex_165 (Array Int Int)) (v_prenex_166 (Array Int Int)) (v_prenex_169 (Array Int Int))) (let ((.cse101 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_165) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_166) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_165) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_166) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse99 (select .cse101 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse100 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_169) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_170) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_169) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_170) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= .cse1 .cse99) (= (select .cse100 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_169) (= v_prenex_165 .cse99) (= (select .cse101 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) (select .cse100 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))))))) (.cse19 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse98 (select (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse1 .cse98) (= v_DerPreprocessor_32 .cse98))))) (.cse6 (exists ((v_prenex_186 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_188 (Array Int Int))) (let ((.cse97 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188))) (and (= (select v_prenex_188 0) .cse5) (= (select .cse97 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse2) (= v_prenex_187 (select .cse97 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (.cse8 (exists ((v_prenex_190 (Array Int Int)) (v_prenex_191 (Array Int Int)) (v_prenex_189 (Array Int Int))) (let ((.cse96 (select (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_191) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_189) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_190) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_191) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_189) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_190) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_191) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse1 .cse96) (= (select v_prenex_191 0) .cse5) (= v_prenex_189 .cse96))))) (.cse68 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse94 (select (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse95 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse1 .cse94) (= .cse95 .cse5) (= v_DerPreprocessor_32 .cse94) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse95) 0 (select v_DerPreprocessor_34 0))))))) (.cse75 (exists ((v_prenex_193 (Array Int Int)) (v_prenex_194 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_prenex_66 (Array Int Int))) (let ((.cse91 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68))) (let ((.cse93 (select .cse91 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse92 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195))) (and (= (select .cse91 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_67) (= (select v_prenex_68 0) .cse5) (= (select .cse92 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse93) (= (select v_prenex_195 0) .cse5) (= .cse93 .cse2) (= v_prenex_193 (select .cse92 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))) (.cse7 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse90 (select (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse1 .cse90) (= v_DerPreprocessor_32 .cse90) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5))))) (.cse17 (exists ((v_prenex_71 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse86 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse87 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_71) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_70) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_71) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_70) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse84 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse81 (select .cse87 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse82 (select .cse86 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse83 (select .cse87 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse81 .cse2) (= v_DerPreprocessor_22 .cse82) (= .cse83 v_prenex_71) (= .cse81 (select .cse84 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse1 .cse85) (= v_DerPreprocessor_32 .cse85) (= .cse81 (select .cse86 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse1 .cse82) (= .cse83 .cse1))))))) (or (and .cse6 .cse7 .cse0 .cse8) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_181 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_182 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse15 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178)) (.cse14 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse13 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse9 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse12 (select .cse15 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse11 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_183 0) .cse5) (= .cse1 .cse9) (= .cse10 v_prenex_181) (= .cse10 .cse1) (= .cse11 v_prenex_179) (= v_DerPreprocessor_32 .cse9) (= .cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= .cse12 .cse2) (= (select v_prenex_178 0) .cse5) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= .cse12 (select .cse14 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse1 .cse11))))) (and .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse16) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_181 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_182 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178)) (.cse26 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse25 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183))) (let ((.cse21 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse20 (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse22 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse24 (select .cse27 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse23 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_183 0) .cse5) (= .cse1 .cse20) (= .cse21 v_prenex_181) (= .cse22 .cse5) (= .cse21 .cse1) (= .cse23 v_prenex_179) (= v_DerPreprocessor_32 .cse20) (= .cse24 (select .cse25 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse24 .cse2) (= (select v_prenex_178 0) .cse5) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse22) 0 (select v_DerPreprocessor_34 0))) (= .cse24 (select .cse26 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse1 .cse23))))) (and .cse28 .cse19 .cse0 .cse16) (and .cse18 .cse19 .cse0) (and (or (exists ((v_prenex_180 (Array Int Int)) (v_prenex_181 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_182 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse30 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178)) (.cse33 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183))) (let ((.cse29 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse32 (select .cse30 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse31 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34))) (and (= (select v_prenex_183 0) .cse5) (= .cse29 v_prenex_181) (= .cse29 .cse1) (= (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_179) (= v_DerPreprocessor_32 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse32 (select .cse33 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= (select v_prenex_178 0) .cse5) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= .cse32 (select .cse31 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)))))) (exists ((v_prenex_193 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_194 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_prenex_68 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse36 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68))) (let ((.cse35 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse34 (select .cse36 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse37 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195))) (and (= .cse34 (select .cse35 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_67) (= v_DerPreprocessor_32 (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_68 0) .cse5) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= (select .cse37 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse34) (= (select v_prenex_195 0) .cse5) (= .cse34 .cse2) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= v_prenex_193 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_prenex_175 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse41 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8))) (let ((.cse38 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse40 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175)) (.cse39 (select .cse41 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= v_DerPreprocessor_32 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= .cse39 (select .cse40 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_6) (= .cse39 (select .cse38 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_173) (= (select v_DerPreprocessor_8 0) .cse5) (= .cse39 .cse2) (= (select v_prenex_175 0) .cse5))))) .cse42 .cse43 .cse44 (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_prenex_186 (Array Int Int)) (v_DerPreprocessor_16 Int) (v_prenex_187 (Array Int Int)) (v_prenex_188 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse47 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188))) (let ((.cse45 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse46 (select .cse47 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= v_DerPreprocessor_32 (select .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_188 0) .cse5) (= .cse46 (select .cse45 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= .cse46 .cse2) (= v_prenex_187 (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) .cse8)) .cse0) (and .cse0 (or (exists ((v_prenex_180 (Array Int Int)) (v_prenex_181 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_182 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse50 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_179) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_178)) (.cse53 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_181) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_182) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_183))) (let ((.cse48 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse49 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse52 (select .cse50 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse51 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34))) (and (= (select v_prenex_183 0) .cse5) (= .cse48 v_prenex_181) (= .cse49 .cse5) (= .cse48 .cse1) (= (select .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_179) (= v_DerPreprocessor_32 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse52 (select .cse53 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select v_prenex_178 0) .cse5) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse49) 0 (select v_DerPreprocessor_34 0))) (= .cse52 (select .cse51 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)))))) (and .cse16 .cse44) (exists ((v_prenex_193 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_194 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse57 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_67) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_66) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_68))) (let ((.cse55 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse54 (select .cse57 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse56 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse58 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_195))) (and (= .cse54 (select .cse55 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse56 .cse5) (= (select .cse57 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_67) (= v_DerPreprocessor_32 (select .cse55 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_68 0) .cse5) (= (select .cse58 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse54) (= (select v_prenex_195 0) .cse5) (= .cse54 .cse2) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse56) 0 (select v_DerPreprocessor_34 0))) (= v_prenex_193 (select .cse58 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (and (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_186 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_188 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse62 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_188))) (let ((.cse60 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse59 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse61 (select .cse62 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= .cse59 .cse5) (= v_DerPreprocessor_32 (select .cse60 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_188 0) .cse5) (= .cse61 (select .cse60 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse59) 0 (select v_DerPreprocessor_34 0))) (= .cse61 .cse2) (= v_prenex_187 (select .cse62 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) .cse8) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse67 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8))) (let ((.cse64 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse63 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse66 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175)) (.cse65 (select .cse67 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= .cse63 .cse5) (= v_DerPreprocessor_32 (select .cse64 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse65 (select .cse66 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse67 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_6) (= .cse65 (select .cse64 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse63) 0 (select v_DerPreprocessor_34 0))) (= (select .cse66 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_173) (= (select v_DerPreprocessor_8 0) .cse5) (= .cse65 .cse2) (= (select v_prenex_175 0) .cse5))))) (and .cse43 .cse16) (and .cse42 .cse16))) (and .cse28 .cse19 .cse0) (and .cse6 .cse68 .cse0 .cse8) (and (or (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse73 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8)) (.cse74 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34))) (let ((.cse69 (select .cse74 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse71 (select .cse73 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse70 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse72 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175))) (and (= .cse1 .cse69) (= .cse70 .cse5) (= v_DerPreprocessor_32 .cse69) (= .cse71 (select .cse72 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse73 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_6) (= .cse71 (select .cse74 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_34 (store (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse70) 0 (select v_DerPreprocessor_34 0))) (= (select .cse72 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_173) (= (select v_DerPreprocessor_8 0) .cse5) (= (select v_prenex_175 0) .cse5))))) (and .cse75 .cse68)) .cse0) (and (or (and .cse75 .cse7) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_prenex_175 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse79 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_8)) (.cse80 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34))) (let ((.cse76 (select .cse80 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse77 (select .cse79 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse78 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_173) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_174) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_175))) (and (= .cse1 .cse76) (= v_DerPreprocessor_32 .cse76) (= v_DerPreprocessor_15 (select (store (store v_DerPreprocessor_34 0 v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_16) 0)) (= .cse77 (select .cse78 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse79 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_6) (= .cse77 (select .cse80 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= (select .cse78 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_173) (= (select v_DerPreprocessor_8 0) .cse5) (= (select v_prenex_175 0) .cse5)))))) .cse0) .cse17)) .cse3) (and (or (exists ((v_prenex_966 (Array Int Int)) (v_prenex_967 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_970 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_963 (Array Int Int))) (let ((.cse124 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_966) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_967) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_966) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_967) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse121 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_970) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_970) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse120 (select .cse124 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse123 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse122 (select .cse124 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse120 .cse2) (= .cse120 (select .cse121 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse121 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_970) (<= (select .cse122 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= v_prenex_966 .cse122) (= .cse120 (select .cse123 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_32 (select .cse123 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (store (store .cse122 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse102) 0 .cse5) .cse89))))) (exists ((v_prenex_1040 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_1026 (Array Int Int)) (v_prenex_1025 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_1039 (Array Int Int))) (let ((.cse127 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1039) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1040) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1039) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1040) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse126 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1025) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1026) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1025) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1026) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse125 (select .cse127 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse128 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= .cse125 (select .cse126 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse125 .cse2) (= v_prenex_1039 (select .cse127 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse126 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_1025) (= v_DerPreprocessor_32 (select .cse128 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse125 (select .cse128 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)))))) (exists ((v_prenex_975 Int) (v_prenex_973 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_1042 (Array Int Int)) (v_prenex_1043 (Array Int Int)) (v_prenex_1035 (Array Int Int)) (v_prenex_1036 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse134 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1035) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1035) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse131 (select .cse134 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse129 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1042) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1043) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1042) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1043) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse132 (select (store (store .cse131 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_973) 0 v_prenex_975) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse130 (select .cse134 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse133 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= (select .cse129 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_1042) (= .cse130 (select .cse129 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= (select .cse131 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse132 .cse5) (= .cse130 .cse2) (= .cse132 v_prenex_973) (= v_DerPreprocessor_32 (select .cse133 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse130 (select .cse133 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_prenex_1035 .cse131)))))) (exists ((v_prenex_978 (Array Int Int)) (v_prenex_979 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_982 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_983 (Array Int Int))) (let ((.cse139 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_978) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_979) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_978) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_979) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse135 (select .cse139 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse136 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_982) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_983) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_982) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_983) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse137 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse138 (select .cse139 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse2 .cse135) (= .cse135 (select .cse136 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse137 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse135) (<= (select .cse138 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= v_prenex_982 (select .cse136 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_DerPreprocessor_32 (select .cse137 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_prenex_978 .cse138) (= .cse89 (store (store .cse138 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse102) 0 .cse5)))))) (exists ((v_prenex_1017 (Array Int Int)) (v_prenex_934 Int) (v_prenex_995 (Array Int Int)) (v_prenex_996 (Array Int Int)) (v_prenex_932 Int) (v_prenex_1018 (Array Int Int)) (v_prenex_997 (Array Int Int)) (v_prenex_933 Int) (v_prenex_998 (Array Int Int)) (v_prenex_931 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse140 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_998) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_996) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_997) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_998) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_996) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_997) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_998))) (let ((.cse145 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1017) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1018) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_995) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1017) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1018) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_995) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1017)) (.cse144 (select .cse140 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse143 (select (store (store .cse144 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_931) 0 v_prenex_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse142 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse141 (select .cse145 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= (select v_prenex_1017 0) .cse5) (= (select .cse140 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse141) (= (select (store (store v_DerPreprocessor_34 0 v_prenex_933) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_prenex_934) 0) v_prenex_933) (= .cse2 .cse141) (= v_DerPreprocessor_32 (select .cse142 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse143 .cse5) (= (select v_prenex_998 0) .cse5) (<= (select .cse144 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse143 v_prenex_931) (= v_prenex_996 .cse144) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= (select .cse142 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse141) (= v_prenex_1018 (select .cse145 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))) (exists ((v_prenex_943 (Array Int Int)) (v_prenex_944 (Array Int Int)) (v_prenex_945 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_946 (Array Int Int)) (v_prenex_949 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_950 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse150 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_946) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_944) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_945) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_946) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_944) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_945) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_946)) (.cse151 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_949) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_950) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_943) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_949) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_950) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_943) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_949))) (let ((.cse148 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse149 (select .cse151 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse146 (select .cse150 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse147 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= (select .cse146 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse147 .cse5) (= v_DerPreprocessor_32 (select .cse148 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_946 0) .cse5) (= .cse149 (select .cse150 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse149 (select .cse148 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select v_prenex_949 0) .cse5) (= (select .cse151 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_950) (= .cse149 .cse2) (= .cse146 v_prenex_944) (= (store (store .cse146 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse147) 0 (select v_DerPreprocessor_34 0)) v_DerPreprocessor_34))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_936 (Array Int Int)) (v_prenex_938 (Array Int Int)) (v_prenex_939 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_940 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_prenex_941 (Array Int Int)) (v_prenex_942 (Array Int Int))) (let ((.cse157 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_940) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_941) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_942) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_940) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_941) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_942) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_940))) (let ((.cse152 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_939) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_936) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_938) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_939) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_936) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_938) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_939)) (.cse154 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse155 (select .cse157 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse156 (select .cse157 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse153 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_936 (select .cse152 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse153 .cse5) (= v_DerPreprocessor_32 (select .cse154 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse155 (select .cse152 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse156 v_prenex_941) (= (select v_prenex_940 0) .cse5) (= .cse155 (select .cse154 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= (select .cse156 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse2 .cse155) (= (select v_prenex_939 0) .cse5) (= (store (store .cse156 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse153) 0 (select v_DerPreprocessor_34 0)) v_DerPreprocessor_34))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_1013 (Array Int Int)) (v_prenex_1012 (Array Int Int)) (v_prenex_1003 (Array Int Int)) (v_prenex_1014 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_prenex_1008 (Array Int Int)) (v_prenex_1007 (Array Int Int))) (let ((.cse160 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1003) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1008) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1007) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1003) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1008) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1007) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1003))) (let ((.cse159 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse158 (select .cse160 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse161 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1014) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1012) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1013) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1014) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1012) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1013) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1014))) (and (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse5) (= .cse158 (select .cse159 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_DerPreprocessor_32 (select .cse159 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse160 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_1008) (= (select .cse161 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse158) (= (select v_prenex_1003 0) .cse5) (= (select v_prenex_1014 0) .cse5) (= .cse158 .cse2) (= v_prenex_1012 (select .cse161 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (exists ((v_prenex_960 (Array Int Int)) (v_prenex_959 Int) (v_prenex_961 (Array Int Int)) (v_prenex_956 Int) (v_prenex_962 (Array Int Int)) (v_prenex_951 (Array Int Int)) (v_prenex_957 Int) (v_prenex_952 (Array Int Int)) (v_prenex_953 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_958 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse166 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_952) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_962) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_951) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_952) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_962) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_951) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_952))) (let ((.cse163 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_961) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_960) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_958) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_961) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_960) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_958) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_961)) (.cse167 (select .cse166 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse162 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse164 (select (store (store .cse167 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_953) 0 v_prenex_956) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse165 (select .cse163 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= v_DerPreprocessor_32 (select .cse162 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_961 0) .cse5) (= (select (store (store v_DerPreprocessor_34 0 v_prenex_957) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_prenex_959) 0) v_prenex_957) (= (select .cse163 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_960) (= (select v_prenex_952 0) .cse5) (= .cse164 .cse5) (= (select .cse162 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse165) (= (select .cse166 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse165) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (<= (select .cse167 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse164 v_prenex_953) (= v_prenex_962 .cse167) (= .cse2 .cse165)))))) (exists ((v_prenex_1009 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_1030 (Array Int Int)) (v_prenex_1033 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_987 Int) (v_prenex_1029 (Array Int Int)) (v_prenex_988 Int)) (let ((.cse173 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1029) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1030) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1029) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1030) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (let ((.cse168 (select .cse173 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse171 (select (store (store .cse168 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_987) 0 v_prenex_988) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse170 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1033) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1009) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1033) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1009) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89)) (.cse169 (select .cse173 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse172 (store (store (store (store (store (store .cse88 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse89))) (and (= v_prenex_1029 .cse168) (= .cse169 (select .cse170 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= (select .cse168 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse171 v_prenex_987) (= .cse169 .cse2) (= .cse171 .cse5) (= v_DerPreprocessor_32 (select .cse172 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_prenex_1033 (select .cse170 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse169 (select .cse172 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))))))) (exists ((v_prenex_989 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_1002 (Array Int Int)) (v_prenex_990 (Array Int Int)) (v_prenex_1001 (Array Int Int)) (v_prenex_1004 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_prenex_1005 (Array Int Int))) (let ((.cse177 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1004) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1002) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1001) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1004) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1002) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1001) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1004)) (.cse179 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1005) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_989) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_990) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1005) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_989) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_990))) (let ((.cse175 (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse174 (select .cse179 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse178 (select .cse177 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse176 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34))) (and (= v_DerPreprocessor_34 (store (store .cse174 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse175) 0 (select v_DerPreprocessor_34 0))) (= .cse175 .cse5) (= (select v_prenex_1004 0) .cse5) (<= (select .cse174 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= v_DerPreprocessor_32 (select .cse176 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_990 0) .cse5) (= v_prenex_1005 .cse174) (= v_prenex_1002 (select .cse177 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse178 .cse2) (= (select .cse179 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse178) (= .cse178 (select .cse176 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)))))) (exists ((v_prenex_1022 (Array Int Int)) (v_prenex_1021 (Array Int Int)) (v_prenex_1023 (Array Int Int)) (v_prenex_992 (Array Int Int)) (v_prenex_993 (Array Int Int)) (v_prenex_994 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_1048 Int) (v_prenex_1047 Int) (v_prenex_1046 Int) (v_prenex_1045 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse185 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1021) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1022) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1023) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1021) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1022) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_1023) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1021))) (let ((.cse181 (select .cse185 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse180 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_34)) (.cse184 (select (store (store .cse181 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_1047) 0 v_prenex_1048) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse183 (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_994) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_992) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_993) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_994) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_992) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_993) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_994)) (.cse182 (select .cse185 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= v_DerPreprocessor_32 (select .cse180 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (select .cse181 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= .cse182 (select .cse180 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_prenex_1022 .cse181) (= .cse182 (select .cse183 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= v_prenex_1045 (select (store (store v_DerPreprocessor_34 0 v_prenex_1045) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_prenex_1046) 0)) (= v_prenex_1047 .cse184) (= .cse184 .cse5) (= (select v_DerPreprocessor_34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse5) (= (select .cse183 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_992) (= (select v_prenex_994 0) .cse5) (= (select v_prenex_1021 0) .cse5) (= .cse182 .cse2))))))) .cse0)))))))) (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) .cse3 (exists ((|ULTIMATE.start_test_fun_~z_ref~0#1.base| Int)) (<= (+ (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) 1) .cse186)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))))) is different from true [2022-11-21 16:32:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:08,262 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-11-21 16:32:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 16:32:08,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:32:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:08,264 INFO L225 Difference]: With dead ends: 72 [2022-11-21 16:32:08,265 INFO L226 Difference]: Without dead ends: 71 [2022-11-21 16:32:08,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=266, Invalid=603, Unknown=5, NotChecked=56, Total=930 [2022-11-21 16:32:08,266 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:08,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 44 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 149 Invalid, 2 Unknown, 1 Unchecked, 1.0s Time] [2022-11-21 16:32:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-21 16:32:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 21. [2022-11-21 16:32:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-21 16:32:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-21 16:32:08,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2022-11-21 16:32:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:08,273 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-21 16:32:08,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 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-21 16:32:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-21 16:32:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:32:08,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:08,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:08,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:32:08,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 16:32:08,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 16:32:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 997059841, now seen corresponding path program 1 times [2022-11-21 16:32:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:32:08,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626915578] [2022-11-21 16:32:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:32:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:08,799 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-21 16:32:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:32:08,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626915578] [2022-11-21 16:32:08,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626915578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:32:08,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964426748] [2022-11-21 16:32:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:08,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:32:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:32:08,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:32:08,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:32:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:08,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 16:32:08,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:09,290 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-21 16:32:09,291 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 38 treesize of output 53 [2022-11-21 16:32:09,299 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-21 16:32:09,355 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:32:09,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-11-21 16:32:09,401 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-21 16:32:09,404 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-21 16:32:09,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:32:09,452 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483649)) is different from false [2022-11-21 16:32:09,666 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-11-21 16:32:09,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2022-11-21 16:32:09,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 16:32:09,722 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-21 16:32:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964426748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:32:09,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:32:09,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-21 16:32:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481112077] [2022-11-21 16:32:09,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:09,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 16:32:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:32:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 16:32:09,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=462, Unknown=1, NotChecked=44, Total=600 [2022-11-21 16:32:09,726 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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-21 16:32:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:10,198 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-11-21 16:32:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:32:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:32:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:10,199 INFO L225 Difference]: With dead ends: 22 [2022-11-21 16:32:10,199 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:32:10,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=758, Unknown=1, NotChecked=60, Total=1056 [2022-11-21 16:32:10,201 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:10,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 25 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2022-11-21 16:32:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:32:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:32:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:32:10,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-11-21 16:32:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:10,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:32:10,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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-21 16:32:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:32:10,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:32:10,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-21 16:32:10,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-21 16:32:10,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-21 16:32:10,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-21 16:32:10,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:32:10,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:32:10,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:32:10,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2022-11-21 16:32:10,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:32:10,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2022-11-21 16:32:10,683 INFO L902 garLoopResultBuilder]: At program point L570(lines 569 571) the Hoare annotation is: true [2022-11-21 16:32:10,683 INFO L899 garLoopResultBuilder]: For program point L562(line 562) no Hoare annotation was computed. [2022-11-21 16:32:10,683 INFO L899 garLoopResultBuilder]: For program point L562-1(line 562) no Hoare annotation was computed. [2022-11-21 16:32:10,684 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 565) no Hoare annotation was computed. [2022-11-21 16:32:10,684 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:32:10,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2022-11-21 16:32:10,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2022-11-21 16:32:10,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:32:10,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:32:10,685 INFO L902 garLoopResultBuilder]: At program point L567(lines 547 568) the Hoare annotation is: true [2022-11-21 16:32:10,685 INFO L899 garLoopResultBuilder]: For program point L561(lines 561 564) no Hoare annotation was computed. [2022-11-21 16:32:10,685 INFO L899 garLoopResultBuilder]: For program point L559(line 559) no Hoare annotation was computed. [2022-11-21 16:32:10,685 INFO L895 garLoopResultBuilder]: At program point L561-2(lines 557 566) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (forall ((v_ArrVal_372 Int)) (let ((.cse1 (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_372)))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse0 (+ (select (select .cse1 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1)) (< 2147483647 v_ArrVal_372) (<= .cse0 2147483648))))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (<= (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647))) [2022-11-21 16:32:10,685 INFO L899 garLoopResultBuilder]: For program point L559-1(line 559) no Hoare annotation was computed. [2022-11-21 16:32:10,685 INFO L899 garLoopResultBuilder]: For program point L557-1(line 557) no Hoare annotation was computed. [2022-11-21 16:32:10,686 INFO L899 garLoopResultBuilder]: For program point L557-3(lines 557 566) no Hoare annotation was computed. [2022-11-21 16:32:10,686 INFO L899 garLoopResultBuilder]: For program point L557-5(lines 557 566) no Hoare annotation was computed. [2022-11-21 16:32:10,689 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:10,691 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:32:10,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:32:10 BoogieIcfgContainer [2022-11-21 16:32:10,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:32:10,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:32:10,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:32:10,712 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:32:10,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:29:52" (3/4) ... [2022-11-21 16:32:10,715 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:32:10,726 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-21 16:32:10,726 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-21 16:32:10,727 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:32:10,727 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:32:10,761 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:32:10,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:32:10,762 INFO L158 Benchmark]: Toolchain (without parser) took 139719.32ms. Allocated memory was 123.7MB in the beginning and 677.4MB in the end (delta: 553.6MB). Free memory was 89.4MB in the beginning and 421.8MB in the end (delta: -332.4MB). Peak memory consumption was 221.7MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,762 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 123.7MB. Free memory was 86.5MB in the beginning and 86.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:32:10,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.26ms. Allocated memory is still 123.7MB. Free memory was 88.9MB in the beginning and 73.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.36ms. Allocated memory is still 123.7MB. Free memory was 73.2MB in the beginning and 71.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,763 INFO L158 Benchmark]: Boogie Preprocessor took 52.59ms. Allocated memory is still 123.7MB. Free memory was 71.6MB in the beginning and 70.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,764 INFO L158 Benchmark]: RCFGBuilder took 437.60ms. Allocated memory is still 123.7MB. Free memory was 70.0MB in the beginning and 57.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,764 INFO L158 Benchmark]: TraceAbstraction took 138558.93ms. Allocated memory was 123.7MB in the beginning and 677.4MB in the end (delta: 553.6MB). Free memory was 56.4MB in the beginning and 424.9MB in the end (delta: -368.6MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,764 INFO L158 Benchmark]: Witness Printer took 50.23ms. Allocated memory is still 677.4MB. Free memory was 424.9MB in the beginning and 421.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:32:10,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 123.7MB. Free memory was 86.5MB in the beginning and 86.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.26ms. Allocated memory is still 123.7MB. Free memory was 88.9MB in the beginning and 73.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.36ms. Allocated memory is still 123.7MB. Free memory was 73.2MB in the beginning and 71.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.59ms. Allocated memory is still 123.7MB. Free memory was 71.6MB in the beginning and 70.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.60ms. Allocated memory is still 123.7MB. Free memory was 70.0MB in the beginning and 57.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 138558.93ms. Allocated memory was 123.7MB in the beginning and 677.4MB in the end (delta: 553.6MB). Free memory was 56.4MB in the beginning and 424.9MB in the end (delta: -368.6MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. * Witness Printer took 50.23ms. Allocated memory is still 677.4MB. Free memory was 424.9MB in the beginning and 421.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 138.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 68 mSDtfsCounter, 513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 35.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 102 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 12 NumberOfFragments, 78 HoareAnnotationTreeSize, 3 FomulaSimplifications, 143 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2439 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 130.5s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 28 QuantifiedInterpolants, 68998 SizeOfPredicates, 40 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 3/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 557]: Loop Invariant [2022-11-21 16:32:10,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,796 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,796 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] [2022-11-21 16:32:10,796 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_372,QUANTIFIED] Derived loop invariant: ((((!(y_ref == x_ref) && x_ref == 0) && y_ref == 0) && (forall v_ArrVal_372 : int :: (unknown-#memory_int-unknown[x_ref := unknown-#memory_int-unknown[x_ref][x_ref := v_ArrVal_372]][y_ref][y_ref] < unknown-#memory_int-unknown[x_ref := unknown-#memory_int-unknown[x_ref][x_ref := v_ArrVal_372]][z_ref][z_ref] + 1 || 2147483647 < v_ArrVal_372) || unknown-#memory_int-unknown[x_ref := unknown-#memory_int-unknown[x_ref][x_ref := v_ArrVal_372]][y_ref][y_ref] <= 2147483648)) && 0 <= unknown-#memory_int-unknown[z_ref][z_ref] + 2147483648) && unknown-#memory_int-unknown[x_ref][x_ref] <= 2147483647 - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 16:32:10,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2350cde0-566d-48f5-84f5-0891780186eb/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE